#include <bits/stdc++.h>

using namespace std;

ifstream f("deque.in");
ofstream g("deque.out");

deque <long long> q;
long long n,k,i,s,v[5000100];
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        while(!q.empty() && v[i]<v[q.back()])q.pop_back();
        q.push_back(i);

        while(!q.empty() && q.front()<=i-k)q.pop_front();

        if(i>=k)s+=v[q.front()];
    }
    g<<s;
    return 0;
}