//026-deque cu deque
#include<iostream>
#include<fstream>
#include<deque>
using namespace std;
int n,k,v[5000001];
long long sum;
deque<int> deq;

void minime()
{
	ifstream fin("deque.in");
	fin>>n>>k;
	
	deq.resize(1);
	for (int i=1;i<=n;i++)
	{
		fin>>v[i];
		while (!deq.empty() && v[i]<=v[deq.back()]) deq.pop_back();
		deq.push_back(i);
		if (deq.front()==i-k) deq.pop_front();
		if (i>=k) sum+=v[deq.front()];
	}
	
	fin.close();
}		

int main ()
{
	minime();
	ofstream fout("deque.out");
	fout<<sum;
	fout.close();
	return 0;
}