#include <bits/stdc++.h>
using namespace std;
const long long int maxn = 2 * (1e5 + 2);
const long long int mod = 1e3 + 2;
map<long long int, vector<long long int> > m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long int a[n + 2], ans = INT_MAX;
  for (long long int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (long long int i = 0; i < n; ++i) {
    long long int num = a[i], c = 0;
    while (num) {
      m[num].push_back(c);
      num = num / 2;
      c = c + 1;
    }
  }
  for (long long int i = 1; i < maxn; i++) {
    long long int t = 0;
    if (m[i].size() >= k) {
      for (long long int j = 0; j < k; ++j) t = t + m[i][j];
      ans = min(ans, t);
    }
  }
  cout << ans << endl;
  return 0;
}
