#include <iostream>
#include <fstream>
#include <deque>

using namespace std;
int findMin(deque<int> &a){
    int re=a.front();
    for(auto x:a){
        if(x<re)re=x;
    }
    return re;
}
int main()
{
    ifstream in("deque.in");
    ofstream out("deque.out");
    int n,k,rez=0;
    deque<int> d;
    int v[500001];
    in >> n;
    in >> k;
    for(int i=1;i<=n;i++){
        in >> v[i];
    }
     for(int i=1;i<=n;i++){
            while(d.size()>0  && v[i]<=v[d.back()])
                d.pop_back();
                d.push_back(i);
            if(d.front()==i-k)d.pop_front();
            if(i>=k)rez+=v[d.front()];
         
    }

    out << rez;
    return 0; ////    1 3
}