#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int i,j,k,N,M,D,a,b;
deque <int> mini,maxi;
int v[5000001];
long long int rasp;
int main()
{
   f>>N>>D;
   for (i=1;i<=N;++i)
        {
            f>>a;v[i]=a;
            if (mini.front()<=i-D)
                mini.pop_front();
            while (mini.size()&&v[mini.back()]>a)
                mini.pop_back();
            mini.push_back(i);
            if (i>=D)
                rasp+=v[mini.front()];
        }

    g<<rasp;
   return 0;

}