#include <cstdio>
#include <algorithm>
#include <deque>

using namespace std;

deque<int> d;
int v[5000010];

int main()
{
    freopen("deque.in", "r", stdin);
    freopen("deque.out", "w", stdout);
    int n,k;
    long long s=0;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++) scanf("%d",&v[i]);
    for(int i=1;i<=n;i++)
    {
        while(!d.empty() && v[i]<=v[d.back()]) d.pop_back();
        d.push_back(i);
        if(d.front()<=i-k) d.pop_front();
        if(i>=k) s+=v[d.front()];
    }
    printf("%lld",s);
    return 0;
}