#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> deq;
int main()
{
    int k,i,n,s=0,v[100000];
    fin>>n>>k;
    for (i=1;i<=n;i++)
    {
        fin>>v[i];
        while (!deq.empty() && v[deq.back()]>=v[i])
            deq.pop_back();
        deq.push_back(i);
        if (deq.front()==i-k)
            deq.pop_front();
        if (i>=k)
            s+=v[deq.front()];
    }
    fout<<s;
        return 0;
}