#include <bits/stdc++.h>

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
const int N=5000010;
int n,k,a[N];
deque<int> q;
long long sol;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)f>>a[i];

    for(int i=1;i<k;i++)
    {
        while(q.size()&&a[i]<=q.back())q.pop_back();
        q.push_back(i);
    }
    for(int i=k;i<=n;i++)
    {
         while(q.size()&&a[i]<=q.back())q.pop_back();
        q.push_back(i);
        sol+=a[q.front()];
        if(q.front()==i-k+1) q.pop_front();
    }
    g<<sol;
    return 0;
}