#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5000001],n,k,head,tail,x,ind[5000001],sum;
void solve()
{
    f>>n>>k>>a[1];head=1;tail=1;ind[1]=1;
    for(int i=2;i<=n;++i)
    {
        f>>x;
        while(head<=tail&&x<a[tail])tail--;
        a[++tail]=x;ind[tail]=i;
        while(ind[head]<i-k+1)head++;
        if(i>=k)sum+=a[head];
    }
    g<<sum;
}
int main()
{
    solve();
    return 0;
}