#include <iostream>
#include <fstream>

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
const int N=5000010;
int  n,k,v[N],st,dr,d[N];
long long sum=0;
int main()
{
f>>n>>k;
st=0;
dr=-1;
for(int i=0; i<n; i++)
{
    f>>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]];
    }
}
g<<sum;
    return 0;
}