Need help with problem from TOI (Thailand Olympiad in Informatics)

Правка en2, от szawinis, 2016-05-31 16:28:02

Problem Statement (story changed so it's easier to understand): The are N problems and M programmers. The ith programmer (1 <= i <= M) can complete the task in ti minutes. Each programmer solves on problem at time. What is the shortest time required for all the programmers to finish all of their tasks?

Example:

Input: N = 5, M = 2, t1 = 7, t2 = 12

Output: 24

Any suggestions? Thanks.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский szawinis 2016-05-31 16:28:02 1 Tiny change: '= 5, M = 2\nt1 = 7,\' -> '= 5, M = 2,\nt1 = 7,\'
en1 Английский szawinis 2016-05-31 16:27:37 469 Initial revision (published)