#include <fstream>

using namespace std;

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

long long v[5000003],dq[5000003];

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