The reckoner Morgana has been asked to balance the workshop's books. On the desk lies a long table of segments readings. 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 <= 2875; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 2875; 0 <= a[i] <= 1000000000.
