#include <fstream>
#include <deque>

using namespace std;

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

long int n, k, x, s = 0;
deque <int> v, d;

int main()
{
	in >> n >> k;
	for (int i = 1; i <= n; i ++)
	{
		in >> x;
		v.push_back(x);
	}

	for (int i = 0; i < n; i ++)
	{
		while (!d.empty() && v[i] < v[d.back()])
			d.pop_back();
		while (!d.empty() && d.front() <= i - k)
			d.pop_front();
		d.push_back(i);

		if (i >= k - 1)
			s += v[d.front()];
	}

    out << s;

    in.close();
    out.close();
    return 0;
}