CF940E. Cashback [贪心+dp]

E Cashback
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Since you are the best Wraith King, Nizhniy Magazin «Mir» at the centre of Vinnytsia is offering you a discount.

You are given an array a of length n and an integer c.

The value of some array b of length k is the sum of its elements except for the smallest. For example, the value of the array [3, 1, 6, 5, 2] with c = 2 is 3 + 6 + 5 = 14.

Among all possible partitions of a into contiguous subarrays output the smallest possible sum of the values of these subarrays.

Input
The first line contains integers n and c (1 ≤ n, c ≤ 100 000).

The second line contains n integers ai (1 ≤ ai ≤ 109) — elements of a.

Output
Output a single integer — the smallest possible sum of values of these subarrays of some partition of a.

Examples
inputCopy
3 5
1 2 3
outputCopy
6
inputCopy
12 10
1 1 10 10 10 10 10 10 9 10 10 10
outputCopy
92
inputCopy
7 2
2 3 6 4 5 7 1
outputCopy
17
inputCopy
8 4
1 3 4 5 5 3 4 1
outputCopy
23
Note
In the first example any partition yields 6 as the sum.

In the second example one of the optimal partitions is [1, 1], [10, 10, 10, 10, 10, 10, 9, 10, 10, 10] with the values 2 and 90 respectively.

In the third example one of the optimal partitions is [2, 3], [6, 4, 5, 7], [1] with the values 3, 13 and 1 respectively.

In the fourth example one of the optimal partitions is [1], [3, 4, 5, 5, 3, 4], [1] with the values 1, 21 and 1 respectively.

题意：给一个有n个元素的序列，可以任意分割成若干个序列，每个序列的价值=元素总和-序列内最小的w个数的和(其中w是序列长度/c下取整)，给出n和原序列以及c的值，求总价值的最小值

题解：总价值的最小值就相当于让减去的数字之和尽可能大，而显然将序列分解成若干个长度为c的序列之和能去掉的最小值之和最大ÿ