#include <fstream>
#define N 5000001
#include <deque>
std::ifstream fin("deque.in");
std::ofstream fout("deque.out");
long long int n, k, arr[N];
std::deque<long long int> D;
int main(){
    fin >> n >> k;
    for(int i = 1; i <= n; i++){
        fin >> arr[i];
    }
    int sum = 0;
    for(int i = 1; i <= n; i++){
        while(!D.empty() && arr[i] <= D.back()){
            D.pop_back();
        }
        D.push_back(arr[i]);
        if(i - k >= 1 && D.front() == arr[i - k]){
            D.pop_front();
        }
        if(i - k >= 0)
            sum += D.front();
    }
    fout << sum ;
}