#include <bits/stdc++.h>
using namespace std;

deque<int>dq;
int v[5000005];
int main()
{
    ifstream cin("deque.in");
    ofstream cout("deque.out");
    
    int n, k;
    long long s=0;
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>v[i];
        if(!dq.empty() && dq.front()==i-k)
        dq.pop_front();
        while(!dq.empty() && v[i]<=v[dq.back()])
        dq.pop_back();
        dq.push_back(i);
        if(i>=k)
        s=s+v[dq.front()];
    }
    cout<<s;

    return 0;
}