Cargo Split

Challenge on lesson: Final 1-B: Cargo Split

CHALLENGE

Difficulty: advanced+25 XP

**Problem.** Line 1: n k. Line 2: n shipment weights. Split them into at most k contiguous blocks minimizing the largest block total. Print that minimum. **Constraints:** 1 <= k <= n <= 200000; 1 <= a[i] <= 1e9. **R versus W.** The graded wrong solution binary-searches with a strictly-fewer-parts predicate.

Press Submit to check your solution.

Back to lesson: Final 1-B: Cargo Split