//#include "pch.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
#include <deque>
#include <algorithm>
#define ll long long int
using	 namespace std;
fstream f("deque.in");
ofstream o("deque.out");
int n, k;
int nr;
vector<int> coada(5000005, 0);
vector<int>v(5000005, 0);
int fata, spate;
ll ans;
int main()
{
	f >> n >> k;
	fata = 1;
	spate = 0;
	for (size_t i = 1; i <= n; i++)
	{
		f >> v[i];
	}

	for (size_t i = 1; i <= n; i++)
	{
		while (fata <= spate && v[i] <= v[coada[spate]])
		{
			spate--;
		}

		coada[++spate] = i;

		if (coada[fata] == i - k)
		{
			fata++;
		}

		if (i >= k)
		{
			ans += v[coada[fata]];
		}

	}
	o << ans;


}