#include <bits/stdc++.h>
using namespace std;
int n,k,i,ma,df,v[5000010],mi;
long long s;
deque<int>dm;
int main()
{
    freopen("deque.in","r",stdin);
    ofstream g ("deque.out");
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i)
        scanf("%d",&v[i]);
        mi=10000001;
    for(i=1; i<=n; ++i)
    {
        while(!dm.empty()&&v[i]<v[dm.back()])dm.pop_back();
        dm.push_back(i);
        if(i-dm.front()==k)dm.pop_front();
        if(i>=k)s+=1LL*v[dm.front()];
    }
    g<<s;
    return 0;
}