#include <bits/stdc++.h>
#define maxn 5000010
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
 
int sir[maxn];
long long suma = 0;
 
int main() {
    int n, k;
    deque <int> coada;
    
    fin >> n >> k;
    for(int i = 1; i <= n; ++i)
         fin >> sir[i];
    
    for(int i = 1; i <= n; ++i) {
        while(!coada.empty() && sir[i] <= sir[coada.back()])
              coada.pop_back();
        
        coada.emplace_back(i);
        
        if(coada.front() == i - k)
            coada.pop_front();
        
        if(i >= k)
           suma += sir[coada.front()];
    }
    fout << suma;
}