#include <bits/stdc++.h>

using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");

using ll = long long;
using ull = unsigned long long;

struct cv {
	int poz;
	int val; 
};

int n,k;
ll ans;
deque<cv> dq;
int main() {
	fin >> n >> k;
	for (int i = 1; i <= n; i++) {
		ll rd;
		fin >> rd;
		while (!dq.empty() && dq.back().val > rd) {
			dq.pop_back();
		}
		dq.push_back({i,rd});
		while (!dq.empty() && dq.front().poz == i - k) {
			dq.pop_front();
		}
		if (i >= k && n >= i)
			ans += dq.front().val;
	}
	fout << ans;
	return 0;
}