#include <cstdio>
#include <list>
#define val first
#define index second

using namespace std;

list< pair<int,int> > q;
int n,k,tot,x;

int main() {
	freopen("deque.in","r",stdin);
	freopen("deque.out","w",stdout);

	scanf("%d %d",&n,&k);

	for(long o=1;o<=n;o++) {
		scanf("%d",&x);
		while(!q.empty() && q.back().val>=x)
			q.pop_back();
		q.push_back( make_pair(x,o) );
		while(!q.empty() && q.front().index<=o-k)
			q.pop_front();
		if(k<=o)
			tot+=q.front().val;
	}

	printf("%d\n",tot);

	return 0;
}