#include <iostream>
#include <deque>

#define NMax 5000005

using namespace std;

int N, X[NMax], K;
deque <int> D;
long long S;

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