#include <fstream>
#include <deque>

using namespace std;

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

const int max_size = 5e6 + 1;

long long v[max_size];
deque <int> dq;

int main ()
{
    long long n, k, ans = 0;
    in >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        in >> v[i];
        while (!dq.empty() && v[dq.back()] >= v[i])
        {
            dq.pop_back();
        }
        if (!dq.empty() && dq.front() == i - k)
        {
            dq.pop_front();
        }
        dq.push_back(i);
        if (i >= k)
        {
            ans += v[dq.front()];
        }
    }
    out << ans;
    in.close();
    out.close();
    return 0;
}