#include <fstream>
#include <iostream>
#include <deque>

using namespace std;

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

const int NMAX = 5e6;
int v[NMAX];

deque<int> dq;

int main()
{
    int n, k;
    f>>n>>k;
    long long int s=0;
    for(int i=0; i<n; i++){
        f>>v[i];
        if(!dq.empty() and dq.front() == i-k)
            dq.pop_front();
        while(!dq.empty() and v[i]<=v[dq.back()])
            dq.pop_back();
        dq.push_back(i);
        if(i >= k-1)
            s+=v[dq.front()];
        
    }
    g<<s;
    
    

    return 0;
}