#include <bits/stdc++.h>

using namespace std;

ifstream fi("deque.in");
ofstream fo("deque.out");
int n,k;
long long s;
int X[5000005];
deque <int> D;

int main()
{
    fi>>n>>k;
    for(int i=1; i<=n; i++)
    {
        fi>>X[i];
        while(!D.empty() && X[i]<=X[D.back()])
            D.pop_back();
        D.push_back(i);
        if(D.front()==i-k)
            D.pop_front();
        if(i>=k)
            s+=X[D.front()];
    }
    fo<<s;
    fi.close();
    fo.close();
    return 0;
}