#include <fstream>
#include <deque>
#include <vector>
using namespace std;

int main(){
	long long n,i,k,s=0,x;
	vector <long long> a;
	deque <long long> d;
	ifstream f("deque.in");
	ofstream g("deque.out");
	f>>n>>k;
	k--;
	for(i=1;i<=n;i++){
		f>>x;
		a.push_back(x);}
	for(i=0;i<n;i++){
		if(d.empty()) d.push_front(i);
		else
			{while(a[i]<a[d.back()]&&!d.empty())
				d.pop_back();
			d.push_back(i);}
		if(d.front()==i-k-1)
			d.pop_front();
		if(i>=k)
			s=s+a[d.front()];}
	g<<s;
	f.close();
	g.close();
	return 0;}