#include <bits/stdc++.h>
using namespace std;

#define NMAX 5000005

ifstream f("deque.in");
ofstream g("deque.out");

int N, K, a[NMAX];
long long sol;
deque < int > Q;

int main() {
    f >> N >> K;
    for (int i = 1; i <= N; ++i) {
        f >> a[i];

        while (Q.size() && a[i] <= a[Q.back()]) {
            Q.pop_back();
        }

        Q.push_back(i);

        if (i - Q.front() >= K) {
            Q.pop_front();
        }

        if (i >= K) {
            sol += 1LL * a[Q.front()];
        }
    }

    g << sol << '\n';
    return 0;
}