#270 · #1231 · Divide Chocolate(分享巧克力)

You have one chocolate bar with pieces of sweetness sweetness[i]. You will share it with k friends, so you cut the bar into k + 1 pieces, each a contiguous segment. You keep the piece with the minimum total sweetness. Return the maximum sweetness you can keep. Constraints: 1 <= k < sweetness.length <= 10^4, 1 <= sweetness[i] <= 10^5.