#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long a[200010];
long long pre[200010];
long long suf[200010];
signed main() {
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (long long i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
  for (long long i = n; i >= 1; i--) suf[i] = suf[i + 1] + a[i];
  long long ans = a[k] * k - pre[k];
  ans = min(ans, suf[n - k + 1] - a[n - k + 1] * k);
  for (long long i = 1; i <= n; i++)
    if (a[i + 1] != a[i]) {
      long long x = i;
      while (a[x] == a[i]) x--;
      long long l = (a[i] - 1) * x - pre[x];
      long long r = suf[i + 1] - (n - i) * (a[i] + 1);
      long long need = k - (i - x);
      ans = min(ans, l + r + need);
      if (k <= i) ans = min(ans, l + need);
      if (need <= n - i) ans = min(ans, r + need);
      if (need <= 0) {
        printf("0");
        return 0;
      }
    }
  cout << ans;
  return 0;
}
