#include<fstream>
#include<set>
#include<deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
multiset<int>heap;
multiset<int>::iterator it;
deque<int>v;
int n,k,i,x;
long long int sum;
int main()
{
    f>>n>>k;
    for(i=1;i<=k;i++)
    {
        f>>x;
        v.push_back(x);
        heap.insert(x);
    }

    for(;i<=n;i++)
    {
        sum+=*heap.begin();
        it=heap.find(v.front());
        heap.erase(it);
        v.pop_front();
        f>>x;
        v.push_back(x);
        heap.insert(x);
    }
    sum+=*heap.begin();
    g<<sum;
    return 0;
}