#include <bits/stdc++.h>   using namespace std;   int main() {     ios::sync_with_stdio(false), cin.tie(0);     ;     long long n, k, i;     cin >> n >> k;     long long a[n], pr[n + 1];     map<long long, long long> f;     for (i = 0; i < n; i++) {       cin >> a[i];       f[a[i]]++;     }     int fl = 0;     for (auto e : f) {       if (e.second >= k) {         cout <<  0 n ;         fl = 1;         break;       }     }     if (!fl) {       sort(a, a + n);       pr[0] = a[0];       for (i = 1; i < n; i++) pr[i] = pr[i - 1] + a[i];       long long ans = 1e18 + 5;       long long left, right, ex, costl, costr;       for (i = 0; i < n; i++) {         left = lower_bound(a, a + n, a[i]) - a;         right = n - (upper_bound(a, a + n, a[i]) - a);         ex = n - left - right;         costl = left * (a[i] - 1);         if (left) costl -= pr[left - 1];         costr = pr[n - 1] - right * (a[i] + 1);         if ((n - right - 1) >= 0) costr -= pr[n - right - 1];         if (left + ex >= k) ans = min(ans, costl + k - ex);         if (right + ex >= k) ans = min(ans, costr + k - ex);         ans = min(ans, costl + costr + k - ex);       }       cout << ans <<   n ;     }   }   