#include <fstream>
#include <deque>
#include <algorithm>

using namespace std;

int main (int argc, char *argv[])
{
	ifstream in("deque.in");
	ofstream out("deque.out");
	long long n, k, x, minim = 0;
	deque<long long> lista;
	deque<long long>::iterator element;
	
	in >> n >> k;
	for (long long i = 0; i != n; ++i)
	{
		in >> x;
		lista.push_front(x);
		if (lista.size() >= k)
		{
			element = min_element(lista.begin(),lista.end());
			minim += *element;
			lista.pop_back();
		}
	}
	out << minim;
	return 0;	
}