#include <bits/stdc++.h>

#define mp make_pair

using namespace std;

deque <pair<int,int> > dq;

int n,v[5000011],k,suma;

int main()
{
    ifstream fin ("deque.in");
    ofstream fout ("deque.out");
    fin>>n>>k;
    for (int i=1;i<=k;++i)
    {
        fin>>v[i];
        pair <int,int> x = mp(v[i],i);
        while (!dq.empty() && dq.back().first>=v[i])
        {
            dq.pop_back();
        }
        dq.push_back(x);
    }
    suma+=dq.front().first;
    //cout<<dq.front().first<<" ";
    for (int i=k+1;i<=n;++i)
    {
        while (dq.front().second<=i-k)
        {
            dq.pop_front();
        }
        fin>>v[i];
        pair <int,int>x=mp(v[i],i);
        while (!dq.empty() && (dq.back().first>=v[i]))
        {
            dq.pop_back();
        }
        dq.push_back(x);
        suma+=dq.front().first;
   // cout<<dq.front().first<<" ";
    }
    fout<<suma;
}