#include <bits/stdc++.h>

using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");
long long n, k, i, a[100002], s;
deque<int> q;

int main() {
    fin >> n >> k;
    for(i = 1; i <= n; i++) fin >> a[i];
    for(i = 1; i <= n; i++) {
        if(q.front() == i - k && !q.empty()) q.pop_front();
        while(!q.empty() && a[i] <= a[q.back()]) q.pop_back();
        q.push_back(i);
        if(i >= k) s += a[q.front()];
    }
    fout << s;

    return 0;
}