#include <fstream>
#include <deque>
using namespace std;
int a[5000002];
deque <int> dq;
int main()
{
    int n,i,k;
    long long sum=0;
    ifstream in("deque.in");
    ofstream out("deque.out");
    in>>n>>k;
    for(i=1;i<=n;i++)
    {
        in>>a[i];
    }
    for(i=1;i<=n;i++)
    {
        while(!dq.empty()&&a[i]<=a[dq.back()])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()==i-k)
            dq.pop_front();
        if(i>=k)
        {
            sum+=a[dq.front()];
        }
    }
    out<<sum;
    return 0;
}