#include <fstream>
#include <deque>

using namespace std;

ifstream cin("deque.in");
ofstream cout("deque.out");

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N, K, x, S = 0;
    cin >> N >> K;

    deque<pair<int, int>> d;

    for (int i = 0; i < K; ++i) {
        cin >> x;

        while (!d.empty() && x < d.front().first) {
            d.pop_front();
        }

        d.emplace_front(x, i);
    }

    for (int i = K; i <= N; ++i) {
        S += d.back().first;

        if (d.back().second <= i - K) {
            d.pop_back();
        }

        cin >> x;

        while (!d.empty() && x < d.front().first) {
            d.pop_front();
        }

        d.emplace_front(x, i);
    }

    cout << S;

    return 0;
}