#include <cstdio>
#include <deque>
using namespace std;

deque <int> deq;
int a[5000005];
long long n,i,k,smin,min;
int crt;

int main() {
	freopen("deque.in","r",stdin);
	freopen("deque.out","w",stdout);
	scanf("%d %d",&n,&k);
	scanf("%d",&a[1]);
	deq.push_back(1);
	for (i=2;i<=k;i++) {
		scanf("%d",&a[i]);
		while (a[i] < a[deq.back()] && !deq.empty()) deq.pop_back();
		deq.push_back(i);
	}
	smin += a[deq.front()];
	for (i=k+1;i<=n;i++) {
		scanf("%d",&a[i]);
		while (a[i] < a[deq.back()] && !deq.empty()) deq.pop_back();
		deq.push_back(i);
		if (deq.front() <= i-k) deq.pop_front();
		smin += a[deq.front()];
	}
	printf("%lld",smin);
	return 0;
}