#include <fstream>
using namespace std;

ifstream f("deque.in");
ofstream g("deque.out");

int v[5000001],dq[5000001];

int main()
{
	int n, k; 
	long long suma_min=0;
	
	f>>n>>k;
	for (int i=1; i<=n; ++i)
		f>>v[i];
	
	int l=1, r=0;
	for (int i=1; i<=n; ++i)
	{
		while(l<=r && v[dq[r]]>=v[i])
			r--;	
	
		r++;
		dq[r] = i;
		
		if (dq[l]==i-k)
			l++;
		if (i>=k)
			suma_min+=v[dq[l]];

	}

	g<<suma_min;
	return 0;
}