#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, k;
    fin >> n >> k;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        fin >> a[i];
    }
    deque<int> dq;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
        while (!dq.empty() && a[dq.front()] >= a[i]) {
            dq.pop_front();
        }
        dq.push_front(i);
        if (i >= k) {
            ans += a[dq.back()];
            if (dq.back() == i - k + 1) {
                dq.pop_back();
            }
        }
    }
    fout << ans;
}