#include <cstdio>
#include <deque>
using namespace std;

int N, K, A[5000001], i;
long long Sum;
deque<int> D;

int main(){

    freopen("deque.in", "r", stdin);
    freopen("deque.out", "w", stdout);

    scanf("%d %d", &N, &K);

    for(i = 1; i <= N; i++){
        scanf("%d", &A[i]);
    }
    for(i = 1; i <= N; i++){
        while (!D.empty() && A[i] <= A[D.back()]) D.pop_back();
        D.push_back(i);
        if (D.front() == i-K) D.pop_front();
        if (i >= K) Sum += A[D.front()];
    }
    printf("%lld", Sum);
    return 0;
}