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

    return 0;
}