Problems > Smallest Sufficient Capacity

Smallest Sufficient Capacity

Difficulty: 1600 3500 ms 128 MB

binary-search

Packages must be shipped in the given order within D days; each day the ship carries consecutive packages up to its capacity. Print the smallest capacity that suffices.

Input: the first line has N and D; the second line has the N package weights.

Output: the minimum capacity.

Constraints:

  • 1 ≤ D ≤ N ≤ 105
  • 1 ≤ wi ≤ 500

Sample Tests

Input 1
10 5
1 2 3 4 5 6 7 8 9 10
Output 1
15
Input 2
3 3
1 2 3
Output 2
3

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.