#include <fstream>
#include <deque>

using namespace std;

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

long long a[5000001],n,k,s,j;

deque<int>d;

int main()
{
    f>>n>>k;
    for(int i=1;i<=n;++i)
    {
        f>>a[i];
    }
    for(int i=1;i<=n;++i)
    {
        j=1;
        while(!d.empty() && a[d.back()]>=a[i] && j<k)
            {
                d.pop_back();
                j++;
            }
        d.push_back(i);
        if(i-d.front()>=k)
        {
            d.pop_front();
        }
        if(i>=k)
        {
            s+=a[d.front()];
        }
    }
    g<<s;
}