#include <fstream>

using namespace std;

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

const int N = 5000001;
int v[N], d[N];

int main()
{
    long long n, k;
    in >> n >> k;
    for(int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    long long s = 0;
    long long st = 0, dr = 0;
    for(int i = 0; i < n; i++)
    {
        if(st <= dr && d[st] == i - k)
        {
            st++;
        }
        while(st <= dr && v[i] <= v[d[dr]])
        {
            dr--;
        }
        d[++dr] = i;
        if(i >= k - 1)
        {
            s += v[d[st]];
        }
    }
    out << s << '\n';
    return 0;
}