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

ifstream cin("deque.in");
ofstream cout("deque.out");

const int N = 5 * 1e6 + 1;
long long s;
int v[N];
int main(){
    int n,k;
    cin>>n>>k;
    deque<int> dq;
    for(int i = 0 ; i < n ; i++){
        cin>>v[i];
        if(!dq.empty() && dq.front() == i - k)
            dq.pop_front();
        while(!dq.empty() && v[dq.back()] >= v[i])
            dq.pop_back();
        dq.push_back(i);
        if(i >= k - 1)
            s += v[dq.front()];
    }
    cout<<s;

}