#include <fstream>
#include <deque>

using namespace std;

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

const int N = 5000000;
int v[N];

int main()
{
    deque <int> dq;
    int n, k;
    long long suma = 0;
    in >> n >> k;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
        //elimin din stanga elementele care nu apartin subsecventei
        if (!dq.empty() && dq.front() == i - k)
        {
            dq.pop_front();
        }
        //elimin din dreapta elementele care nu vor mai fi minime
        while (!dq.empty() && v[i] <= v[dq.back()])
        {
            dq.pop_back();
        }
        dq.push_back(i);
        if (i >= k - 1)
        {
            suma += v[dq.front()];
        }
    }
    out << suma;

    in.close();
    out.close();
    return 0;
}