#include <stdio.h>
#include <stdlib.h>
#include <deque>
using namespace std;
int n,i,k,a[5000005];
long long res;
deque<int> q;
void solve()
{
    int i;
    for (i=1;i<=k;i++)
    {
        while (!q.empty() && a[q.back()]>=a[i])
            q.pop_back();
        q.push_back(i);
    }
    for (i=k+1;i<=n;i++)
    {
        res+=(long long)a[q.front()];
        while (!q.empty() && a[q.back()]>=a[i])
            q.pop_back();
        if (!q.empty() && q.front()<=i-k)
            q.pop_front();
        q.push_back(i);
    }
    res+=(long long)a[q.front()];
}
int main()
{
    freopen ("deque.in","r",stdin);
    freopen ("deque.out","w",stdout);
    scanf("%i%i",&n,&k);
    for (i=1;i<=n;i++)
        scanf("%i",&a[i]);
    solve();
    printf("%lld",res);
    fclose(stdin);
    fclose(stdout);
    return 0;
}