#include <fstream>
#include <iostream>

using namespace std;

const int N=50000001;
ifstream in("deque.in");
ofstream out("deque.out");

int v[N];
int d[N];

int main()
{
    int st,dr,k,n;
    long long sum;
    in>>n>>k;
    st=0;
    dr=-1;
    sum=0;
    for(int i=0; i<n; i++)
    {
        in>>v[i];
        if(st<=dr&&d[st]==i-k)
        {
            st++;
        }
        while(st<=dr&&v[i]<=v[d[dr]])
        {
            dr--;
        }
        d[++dr]=i;
        if(i>=k-1)
        {
            sum+=v[d[st]];
        }
    }
    out<<sum;

    return 0;
}