#include <iostream>
#include <deque>
#include <stdio.h>
#include <fstream>

using namespace std;

#define MAX 5000010

int main()
{
    ifstream fin("deque.in");
    ofstream fout("deque.out");

    int N, K, v[MAX]/*, minime[MAX]*/;
    long long sum = 0;

    fin >> N >> K;
    deque<int> dq;

    for (int i = 0; i < N; i ++) {
        fin >> v[i];
    }

    for(int i = 0; i < N; i++) {
        while (!dq.empty() && dq.back() <= i - K) {
            dq.pop_back();
        }

        while (!dq.empty() && v[dq.front()] > v[i]) {
            dq.pop_front();
        }

        dq.push_front(i);

        if (i >= K - 1) {
            sum += v[dq.back()];
        }

        //minime[i] = dq.back();
    }
/*
    for (int i = K - 1; i < N; i++) {
        sum += v[minime[i]];
    }*/

    fout << sum;

    fin.close();
    fout.close();

    return 0;
}