#include <bits/stdc++.h>   using namespace std;   const long long INF = 1e18 + 9;   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     long long n, k;     cin >> n >> k;     vector<long long> a(n);     for (long long i = 0; i < n; i++) {       cin >> a[i];     }     sort(a.begin(), a.end());     vector<long long> pref(n, 0), suf(n, 0);     for (long long i = 1, sm = a[0]; i < n; i++) {       pref[i] = a[i] * i - sm;       sm += a[i];     }     for (long long i = n - 2, sm = a[n - 1]; i >= 0; i--) {       suf[i] = sm - a[i] * (n - i - 1);       sm += a[i];     }     long long ans = INF;     for (long long i = 0, j = 0; i < n; i = j) {       for (; j < n && a[j] == a[i]; j++)         ;       long long prev = 0, forw = 0;       long long base = INF;       prev += pref[i];       prev -= i;       if (i >= k - j + i) base = min(base, prev);       forw += suf[j - 1];       forw -= (n - j);       if (n - j >= k - j + i) base = min(base, forw);       base = min(base, prev + forw);       ans = min(ans, base + k - (j - i));       if (j - i >= k) ans = 0;     }     cout << ans << endl;     return 0;   }   