#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const long long oo = 1e18;
  int n, k;
  cin >> n >> k;
  vector<long long> v(n + 1);
  for (int i = 1; i <= n; i++) cin >> v[i];
  sort(v.begin() + 1, v.end());
  vector<long long> acum(n + 1);
  for (int i = 1; i <= n; i++) acum[i] = acum[i - 1] + v[i];
  long long ans = oo;
  int last = 0;
  for (int i = 1; i <= n; i++) {
    if (v[i] != v[i + 1] || i == n) {
      int many = i - last;
      if (many >= k) {
        ans = 0;
        break;
      }
      long long left = (v[i] - 1ll) * last - acum[last];
      long long right = acum[n] - acum[i] - (v[i] + 1ll) * 1ll * (n - i);
      if (i >= k) ans = min(ans, left + 1ll * k - 1ll * many);
      if (n >= k + last) ans = min(ans, right + 1ll * k - 1ll * many);
      ans = min(ans, left + right + 1ll * k - 1ll * many);
      last = i;
    }
  }
  cout << ans << '\n';
  return 0;
}
