#include <fstream>
#include <deque>

using namespace std;

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

const int NMAX = 5000000 + 5;

int N, K, v[NMAX];
long long sum;

deque <int> dq;

int main()
{
    fin >> N >> K;

    for(int i = 1; i <= N; i++)
        fin >> v[i];

    for(int i = 1; i <= N; i++)
    {
        while(!dq.empty() && v[dq.back()] >= v[i])
            dq.pop_back();

        dq.push_back(i);

        while(!dq.empty() && dq.front() <= i - K)
            dq.pop_front();

        if(i >= K)
            sum += 1LL * v[dq.front()];
    }

    fout << sum << '\n';

    return 0;
}