#include <fstream>
#include <queue>

using namespace std;

int main() {
    
    priority_queue<int, vector<int>, greater<int>> H;
    ifstream fin("deque.in");
    int n, k, x;
    long long s = 0;
    fin >> n >> k;
    for (int i = 0; i < k; ++i)
    {
        fin >> x;
        H.push(x);
    }
    
    for (int i = k+1; i < n; ++i)
    {
        s += H.top();
        H.pop();
        fin >> x;
        H.push(x);
    }
    
    s += H.top();
    fin.close();
    
    ofstream fout("deque.out");
    fout << s;
    fout.close();
    
    return 0;
}