#include <bits/stdc++.h>
using namespace std;
long long n, k, i, sum;
struct elem
{
    long long val;
    long long poz;
}x;
deque <elem> Q;
int main()
{
    cin >> n >> k;
    for(i = 1; i <= n; i ++)
    {
        cin >> x.val;
        x.poz = i;
        while(!Q.empty() && Q.back().val >= x.val)
            Q.pop_back();
        Q.push_back(x);
        if(i < k)continue;
        while(Q.front().poz  <= i - k)
            Q.pop_front();
        sum = sum + Q.front().val;
    }
    cout << sum;
    return 0;
}