#include <bits/stdc++.h>
using namespace std;
#define maxn 5000010
int N,K;
int A[maxn], deq[maxn];
int front, back;
long long Sum;
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int i;
f >> N >> K;
for(i=1;i<=N;i++)
	f >> A[i];
front = 1, back = 0; 	// front>back => deque vid
for(i=1;i<=N;i++)
{
	while(front<=back && A[i] <= A[deq[back]])
		back--;
	deq[++back] = i;
	if(deq[front] == i-K)
		front++;
	if(i>=K)
		Sum += A[deq[front]];
}
g<<Sum;
f.close();
g.close();
return 0;
}