#include <fstream>
#include <deque>

using namespace std;
deque< pair< int,int > > q;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,i,sol,a[5000010];
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>a[i];
    for(i=1;i<=k;i++)
    {
        while(a[i]<q.front().first&&q.size())
            q.pop_front();
        q.push_front(make_pair(a[i],i));
    }
    sol=q.back().first;
    for(i=k+1;i<=n;i++)
    {
        while(a[i]<q.front().first&&q.size())
            q.pop_front();
        q.push_front(make_pair(a[i],i));
        if(q.back().second<=i-k)
            q.pop_back();
        sol+=q.back().first;
    }
    g<<sol;
    return 0;
}