#include <iostream>
#include <deque>
#include <vector>
#include <cstdio>

using namespace std;

deque <int> q;
int a[5000000];
int n,k,x;
long long sum;

int main()
{
    freopen("deque.in","r",stdin);
    freopen("deque.out","w",stdout);

    cin>>n>>k;

    for(int i=0;i<k;++i)
    {
        cin>>a[i];
        while(!q.empty() && a[q.back()]>a[i])
            q.pop_back();

        q.push_back(i);
    }
    sum+=a[q.front()];

    for(int i=k;i<n;++i)
    {
        cin>>a[i];
        while(!q.empty() && a[q.back()]>a[i])
            q.pop_back();

        q.push_back(i);
        while(!q.empty() && q.back()-q.front()>=k)
            q.pop_front();

        sum+=a[q.front()];
    }

    cout<<sum;

    return 0;
}