#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

int v[5000005], n, k;
long long sum;
deque < int > D;

int main()
{
    fin >> n >> k;
    for (int i=0; i<n; i++)
        fin >> a[i];
    dq.push_front(0);
    for (int i=1; i<n; i++)
    {
        if (D.front()==i-k)
        {
            D.pop_front();
        }
        while(!D.empty() && a[i]<a[D.back()])
        {
            D.pop_back();
        }
        dq.push_back(i);
        if (i>=k-1)
            sum+=a[D.front()];
    }
    fout << sum;
    return 0;
}