#include <fstream>
#include <deque>

#define ll long long

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

int n, k, a[5000010];
ll rez = 0;
deque<int> dq;

int main() {
	fin >> n >> k;
	for (int i = 1; i <= n; i++) {
		fin >> a[i];

		while (!dq.empty() && a[i] <= a[dq.back()])
			dq.pop_back();
		dq.push_back(i);

		if (dq.front() == i - k)
			dq.pop_front();

		if (i >= k)
			rez += a[dq.front()];
	}

	fout << rez;
	return 0;
}