1
class Solution:
2
    def splitArray(self, nums: List[int], m: int) -> int:
3
        lo, hi = max(nums), sum(nums)
4
        while lo < hi:
5
            mid = (lo + hi) // 2
6
            tot, cnt = 0, 1
7
            for num in nums:
8
                if tot + num <= mid:
9
                    tot += num
10
                else:
11
                    tot = num
12
                    cnt += 1
13
            if cnt > m:
14
                lo = mid + 1
15
            else:
16
                hi = mid
17
        return hi