In the archive halls of Scrollkeep, Rhys the surveyor keeps careful count of the windows. Fulfill a tricky customer order, every figure matters. Task: Print the minimum sum of any contiguous subarray of length exactly k. Input format: First line: n and k. Second line: n integers. Output format: Print the minimum window sum. Constraints: 1 <= k <= n <= 1030; -1000000 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 1030; -1000000 <= a[i] <= 1000000000.
