#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k;
int rez=0;
int A[5000010];
deque <int> D;
int main()
{
    fin>>n>>k;
    for (int i=1;i<=n;i++)
        fin>>A[i];
    D.push_back(0);
    D.push_front(1);
    for (int i=1;i<=n;i++)
    {
        while (!D.empty() && A[i]<=A[D.back()])
            D.pop_back();
        D.push_back(i);
        if (D.front()<=i-k)
            D.pop_front();
        if (i>=k)
            rez+=A[D.front()];
    }
    fout<<rez;
    return 0;
}