#include <stdio.h>
#include<deque>

#define maxn 5000010

int n,k,i;
int a[maxn];
long long sum;

using namespace std;
deque <int> d;

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


	}
	printf("%lld\n", sum);

	return 0;
}