#include <stdio.h>
#include <stdlib.h>
#define N 5000000

int v[N], dq[N];

int main()
{
    FILE *in, *out;
    in = fopen("deque.in", "r");
    out = fopen("deque.out", "w");
    int n, k;
    fscanf(in, "%d%d", &n, &k);
    long long sum = 0;
    int st = 0, dr = -1;
    for (int i = 0; i < n; i++)
    {
        fscanf(in, "%d", &v[i]);
        ///cat timp dq e e nevid si v[i] e mai bun sau egal cu cel mai prost din dq
        while (st <= dr && v[i] <= v[dq[dr]])
        {
            dr--;///elimin din dreapta
        }
        if (st <= dr && dq[st] == i - k)
        {
            st++;///elimin din stanga
        }
        dq[++dr] = i;
        if (i >= k - 1)
        {
            sum += v[dq[st]];
        }
    }
    fprintf(out, "%lld\n", sum);
    fclose(in);
    fclose(out);
    return 0;
}