#include <cstdio>
#include <deque>

#define NMAX 5000007
#define LL long long

using namespace std;

deque< int > Deq;
int a[NMAX];
int n, k;
LL Ans;

int main(){
    freopen("deque.in", "r", stdin);
    freopen("deque.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &a[i]);
        while(! Deq.empty() && a[Deq.back()] > a[i])
            Deq.pop_back();
        Deq.push_back(i);
        if(Deq.front() == i - k)
            Deq.pop_front();
        if(i >= k && ! Deq.empty())
            Ans += (LL)a[Deq.front()];
    }
    printf("%lld", Ans);
    return 0;
}