#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll calcSum(ll m, ll p, ll k, ll i) {
    ll res = m * k;
    res -= (i - p) * (i - p + 1) / 2;
    res += (k + p - i - 1) * (k + p - i) / 2;
    return res;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll n, k;
    cin >> n >> k;

    vector<ll> vec(n);
    unordered_map<ll, ll> last;
    last.reserve(n);

    for (int i=0; i < n; i++) cin >> vec[i];

    set<ll> ms;
    ll curr = 0;
    ll ans = LLONG_MAX;

    for (int i=0; i < k - 1; i++) {
        ms.insert(vec[i]);
        last[vec[i]] = i;
        curr += vec[i];
    }

    for (ll i=k-1; i < n; i++) {
        ms.insert(vec[i]);
        last[vec[i]] = i;
        curr += vec[i];

        int max_val = *ms.rbegin();
        int max_idx = last[max_val];

        ans = min(ans, calcSum(max_val, max_idx, k, i) - curr);

        if (last[vec[i - k + 1]] == i - k + 1) {
            ms.erase(vec[i - k + 1]);
        }
        curr -= vec[i - k + 1];
    }

    cout << ans << '\n';

    return 0;
}