#include<iostream>
#include <fstream>
#include <vector>
#include <list>
using namespace std;
#define Parcurg( C, it ) \
    for( list<int>::iterator it = C.begin(); it != C.end(); it++ )
int n, k, x, c=0, minim=0;
long int s=0;
list<int> l;
list<int>::iterator it;
void insert(int ce){
    while(l.size() && ce>*l.begin())
        l.pop_front();
    l.push_front(ce);

}
int main(){
    ifstream f("deque.in");
    f>>n>>k;
    c=0;
    while(c++<k)
        f>>x, insert(x);
    while(f>>x){
        s+=*l.begin();
        insert(x);
    }

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