#include <iostream>
#include <queue> // priority_queue
                 
using namespace std;

int main(void)
{
    int n, k, x;
    cin >> n >> k;

    priority_queue<int, vector<int>, greater<int>> pq;

    int sum = 0;
    for (int i = 0; i < k; i++) {
        cin >> x;
        pq.push(x);
        sum += x;
    }


    for (int i = k; i < n; i++) {
        cin >> x;
        pq.push(x);
        sum += x;
        sum -= pq.top();
        pq.pop(); // najmanji
    }

    cout << sum << endl;
    
    return 0;
}