#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
using ll = long long;

ifstream f("deque.in");
ofstream g("deque.out");

const int Nmax=5e6;
int V[Nmax+3],n,k;
deque <int> Q;
ll S=0;

int32_t main()
{
    f >> n >> k;
    for(int i=1; i<=n; i++)
        f >> V[i];
    for(int i=1; i<=k; i++)
    {
        while(Q.size() && V[Q.back()]>=V[i])
            Q.pop_back();
        Q.push_back(i);
    }
    S+=1LL * V[Q.front()];
    for(int i=k+1; i<=n; i++)
    {
        while(Q.size() && V[Q.back()] >= V[i])
            Q.pop_back();
        Q.push_back(i);
        if(Q.front()<i-k+1)
            Q.pop_front();
        S+=1LL * V[Q.front()];
    }
    g << S;
    return 0;
}