#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");

deque<int> l;

int a[5000001];

int main()
{
    int n,k;
    long long s=0;
    fin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        fin>>a[i];
        if(!l.empty())
            while(a[l.back()]>a[i])
            {
                l.pop_back();
            }
        l.push_back(i);
        if((i-k)==l.front())
            l.pop_front();
        if(i>=k)
            s+=a[l.front()];
    }
    fout<<s;
    return 0;
}