#include<fstream>
#include<deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque<int>q;
int v[5000001],i,n,k;
long long s;
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        while(!q.empty()&&v[i]<=v[q.back()])
        {
            q.pop_back();
        }
        q.push_back(i);
        if(q.front()<=i-k)
          q.pop_front();
        if(i>=k)
          s=s+v[q.front()];
    }
    fout<<s<<endl;
    return 0;
}