#include<iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
#define Parcurg( C, it ) \
    for( multiset<int>::iterator it = C.begin(); it != C.end(); it++ )
int n, k, s=0, x, c=0, minim=0;
multiset<int> heap;
vector<int> v;

int main(){
    ifstream f("deque.in");
    f>>n>>k;
    while(c++<k)
        f>>x, heap.insert(x), v.push_back(x);

    while(f>>x){
        minim=*heap.begin();
        s+=minim;
        heap.insert(x);
        v.push_back(x);
        heap.erase(v[c++]);
        cout<<"in:"<<x<<"\nout:"<<v[c]<<"\n";
    }

    ofstream g("deque.out");
    cout<<s;
    return 0;
}