// Source: Yassinezeort

#include <bits/stdc++.h>

using namespace std;

#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)


void insert(vector<int> &v , int a){
    v.push_back(a);
    v[0]++;
    int i = v[0] ;
    while(i > 1 && v[i/2] > v[i]){
        swap(v[i] , v[i/2]);
        i/=2 ;
    }
}

void del(vector<int> &v){
    int sm = v[1] ;
    v[1] = v[v[0]] ;
    v[0]--;
    v.pop_back();
    int i = 1 ;
    while (true){
        int l = 2*i , r = 2*i+1 , smallest = i ;
        if (l <= v[0] && v[l] < v[smallest] )
            smallest = l ;
        if (r <= v[0] && v[r] < v[smallest] )
            smallest = r ;
        if (smallest != i){
            swap(v[i] , v[smallest]) ;
            i = smallest ;
        }
        else
            break ;
    }
}


int main() {
    io;
    int n , k ; cin >> n >> k ;
    vector<int> heap(1 ,0);
    for (int i = 0; i < n; ++i) {
        int a ; cin >> a ;
        insert(heap , a) ;
        if (heap[0] > k){
            del(heap);
        }
    }
    long long res = 0 ;
    for (int i = 1 ; i <= heap[0] ; ++i) {
        res += heap[i];
    }
    cout << res ;

}