#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,deque[5000010],v[5000010],front,back,s;
int main()
{
	f>>n>>k; int i;
	for(i=1;i<=n;i++)
		f>>v[i];
	front=1;back=0;
	for(i=1;i<=n;i++)
	{
		while(front<=back && v[i]<=v[deque[back]]) back--;
		deque[++back]=i;
		if(deque[front]==i-k) front++;
		if(i>=k) s+=v[deque[front]];
	}
	g<<s<<'\n';
	f.close();
	g.close();
	return 0;
}