Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest subarray sum is minimized. Return that minimized largest sum.

Example 1:

Input: 7 2 5 10 8
k: 2
Output: 18

Example 2:

Input: 1 2 3 4 5
k: 2
Output: 9

Input format: Line 1: space-separated array. Line 2: k.

Output format: Minimized largest subarray sum.