#include <cstdio>

using namespace std;

const int MAX_N = 5000000;

FILE *in, *out;

int dq[MAX_N], st, dr;

int v[MAX_N];

int main()
{
    in = fopen("deque.in","r");
    out = fopen("deque.out", "w");
    int n, k;
    int i;
    long long sum = 0;
    fscanf(in, "%d%d", &n, &k);
    for(i = 0; i < n; i++)
        fscanf(in, "%d", &v[i]);
    st = 0;
    dr = -1;
    for(i = 0; i < n; i++)
    {
        while(st <= dr && v[dq[dr]] >= v[i]) dr--;
        dq[++dr] = i;
        if(dq[st] == i-k) st++;
        if(i >= k) sum += v[dq[st]];
    }
    fprintf(out, "%lld", sum);
    fclose(in);
    fclose(out);
    return 0;
}