#include <bits/stdc++.h>
#define cin ci
#define cout co
#define ll long long
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int n, k;
vector<int> v;
int32_t main()
{
    cin >> n >> k;
    v.resize(n + 5);
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    deque<int> dq;
    ll ans = 0;
    for(int i = 1; i <= n; i++)
    {
        while(!dq.empty() && v[dq.front()] >= v[i])
            dq.pop_front();

        dq.push_front(i);

        if(i - k + 1 > dq.back())
            dq.pop_back();

        if(i >= k)
            ans += v[dq.back()];
    }
    cout << ans;
    return 0;
}