#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 11;
long long a[N], s[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];
  int pos = 1;
  long long ans = 2e18;
  for (int i = 1; i <= n; i++)
    if (a[i] != a[i + 1]) {
      int kol = i - pos + 1;
      if (kol >= k) {
        ans = 0;
        break;
      }
      if (i >= k) {
        long long res = 0;
        res += (a[i] - 1) * 1ll * (pos - 1) - s[pos - 1];
        res += k - kol;
        ans = min(ans, res);
      }
      if (kol + n - i >= k) {
        long long res = 0;
        res += s[n] - s[i] - (a[i] + 1) * 1ll * (n - i);
        res += k - kol;
        ans = min(ans, res);
      }
      long long res = 0;
      res += (a[i] - 1) * 1ll * (pos - 1) - s[pos - 1];
      res += s[n] - s[i] - (a[i] + 1) * 1ll * (n - i);
      res += k - kol;
      ans = min(ans, res);
      pos = i + 1;
    }
  cout << ans;
}
