#include <fstream>
#include <deque>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");

deque<int> B;
int a[5000001];
int N,k;
long long S;

int main(){

    in >> n >> k;
    for(int i = 1; i <= N; ++i){
        in >> a[i];
        while(!B.empty() and a[B.front()]>a[i])
            B.pop_front();

        B.push_front(i);

        if(!B.empty() and i-B.back()+1>=k)
            B.pop_back();

        if(i>=k)   S+=a[B.back()];
    }
    out << S;

    return 0;
}