#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;

multiset<int>s;
multiset<int>::iterator it;
int v[5000005],n,k;

int main(){
    long long sum;
    freopen("deque.in","r",stdin);
    freopen("deque.out","w",stdout);
        scanf("%d %d",&n,&k);

        for(int i=1;i<=k;i++)
        {
            scanf("%d",&v[i]);
            s.insert(v[i]);
        }
        sum=*s.begin();
        for(int i=k+1;i<=n;i++)
        {
            scanf("%d",&v[i]);
            it=s.find(v[i-k]);
            s.erase(it);
            s.insert(v[i]);
            sum+=*s.begin();
        }
        printf("%lld\n",sum);
    return 0;
}