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

using namespace std;
int n, k; long long suma = 0;
int a[50000005];
deque<int>Q;

void pushElement(int x){
    while(!Q.empty() && a[Q.back()] >= a[x])
        Q.pop_back();
    Q.push_back(x);
}

void peekElement(int pos){
    while(!Q.empty() && pos - Q.front() > k)
        Q.pop_front();
}

void parcurgere(){
    for(int i=0; i<k; ++i){
        pushElement(i);
    }
    for(int i=k; i<n; ++i){
        peekElement(i);
        if(!Q.empty())
            suma += (long long)a[Q.front()];
        pushElement(i);
    }
    peekElement(n);
    if(!Q.empty())
        suma += (long long)a[Q.front()];
}

int main()
{
    ifstream f("deque.in");
    f>>n>>k;
    for(int i=0; i<n; ++i)
        f>>a[i];
    ofstream g("deque.out");
    parcurgere();
    g<<suma;
    return 0;
}