#include <bits/stdc++.h>

std::ifstream fin("deque.in");
std::ofstream fout("deque.out");

int main() {
    int n, k;
    fin >> n >> k;

    std::deque<int> dq;
    long long sum = 0;

    std::vector<int> A(n + 1);
    for(int i = 1; i <= n; ++i) {
        fin >> A[i];
    }

    for(int i = 1; i <= n; ++i) {
        if(!dq.empty() && dq.front() < i - k + 1) {
            dq.pop_front();
        }

        while(!dq.empty() && A[dq.back()] >= A[i]) {
            dq.pop_back();
        }

        dq.push_back(i);

        if(i >= k) {
            sum += A[dq.front()];
        }
    }

    fout << sum;
    return 0;
}