#include <bits/stdc++.h>
using namespace std;
ifstream f ("deque.in");
ofstream g ("deque.out");
deque <pair<int, int>> mini;
long long n, k, sum, v[5000005];
int main()
{

    f >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        f >> v[i];
        while (!(mini.empty()) && v[i] <= mini.back().first)
        {
            mini.pop_back();
        }
        mini.push_back({v[i], i});

        if (i-k == mini.front().second)
            mini.pop_front();


        if(i >= k)

            sum += mini.front().first;
    }
    g<<sum;

    return 0;
}