#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
	int n, k;
	while(scanf("%d%d", &n, &k)==2)
	{
		vector<int> original(n);
		vector<pair<int,int> > p(n);
		for(int i=0;i<n;++i) {
			scanf("%d", &p[i].first);
			original[i] = p[i].first;
			p[i].second = i;
		}
		sort(p.begin(), p.end());
		priority_queue <int, vector<int>,std::greater<int> > caros;
		const int c = k<n?n-k*n/(k+1):0;
		int answer = 0, end = c, canjeados = k;
		for(int i=0;i<c;++i) {
			caros.push(p[p.size()-1-i].second);
		}
		// esto es un comentario
		while(!caros.empty()) {
			int aux = caros.top();
			caros.pop();
			if(aux<canjeados) {
				caros.push(p[p.size()-1-end].second);
				++end;
				//printf("or: %d\n", original[aux]);
				answer += original[aux];
			}
			else {
				canjeados += k;
			}
		}
		for(int i=end;i<p.size();++i) {
			//printf("p: %d\n", p[p.size()-1-i].first);
			answer += p[p.size()-1-i].first;
		}
		printf("%d\n", answer);
	}
	return 0;
}