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

#define ll long long
using namespace std;

vector<ll> nums;


ll solve(int n, int k){

    deque<ll> q(k);

    int i = 0, res = 0;
    for(; i < k; ++i){

        while((!q.empty()) && nums[i] <= nums[q.back()])
            q.pop_back();

        q.push_back(i);
    }


    for(; i < n; ++i){
        res += nums[q.front()];
        while((!q.empty()) && q.front() <= i - k)
            q.pop_front();

        while((!q.empty()) && nums[i] <= nums[q.back()])
            q.pop_back();
        q.push_back(i);
    }


    return res + nums[q.front()];



}



int main(){
    ifstream be("deque.in");
    ofstream ki("deque.out");


    int n, k;
    be >> n >> k;
    int temp;
    for(int i = 0; i < n; i++){
        be >> temp;
        nums.push_back(temp);
    }

    ki << solve(n, k);

}