#include <fstream>
#include <queue>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,v[nmax],k;
long long sol;
deque<int>q;
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>v[i];
        while(!q.empty()&&i-q.front()>=k)
            q.pop_front();
        while(!q.empty()&&v[q.back()]>v[i])
            q.pop_back();
        q.push_back(i);
        if(i>=k)
            sol+=v[q.front()];
    }
    cout<<sol;
    return 0;
}