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

#define maxLn 5000001

ifstream f("deque.in");
ofstream g("deque.out");

deque <int> deq;

int arr[maxLn];

int main() {
	int n, k;
	f >> n >> k;
	for (int i = 1; i <= n; i++) {
		f >> arr[i];
	}
	int back, front, sum = 0;
	for (int i = 1; i <= n; i++) {
		int back = deq.size() - 1;
		front = 0;
		while(front <= back && arr[i] <= arr[deq.at(back)]) {
			back--;
			deq.pop_back();
		}
		deq.push_back(i);
		if (deq.front() == i - k) {
			deq.pop_front();
		}
		if (i >= k) {
			// cout << arr[deq.front()] << " " << deq.front() << endl;
			sum += arr[deq.front()];
		}
		// for (int j = 0; j < deq.size(); j++){
		// 	cout << deq.at(j) << " ";
		// }
		// cout << endl;
	}
	g << sum << "\n";
	return 0;
}