#include <iostream>
#include <fstream>
#include <deque>
#include <vector>

using namespace std;

int main()
{
    ifstream in("deque.in");
    ofstream out("deque.out");
    int n, k;
    in >> n >> k;
    long long sum = 0;
    vector <int> v(n);
    deque <int> dq;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
        ///elimin din stanga daca primul nu mai face parte din secv. ultimilor k
        if (!dq.empty() && dq.front() == i - k)
        {
            dq.pop_front();
        }
        ///elimin din dreapta elementele care sigur nu vor mai fi minime
        while (!dq.empty() && v[i] <= v[dq.back()])
        {
            dq.pop_back();
        }
        dq.push_back(i);
        if (i >= k - 1)
        {
            sum += v[dq.front()];
        }
    }
    out << sum ;

    return 0;
}