#include <bits/stdc++.h>
#pragma GCC optimize("03")
using namespace std;
long long int const mod = 1000000007;
long long int br[200100][61];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k, x, ans = 1e12, mx = 0, cnt, k1, d;
  cin >> n >> k;
  for (long long int i = 1; i <= n; i++) {
    cin >> x;
    mx = max(mx, x);
    cnt = 0;
    while (x >= 1) {
      br[x][cnt] += 1;
      x /= 2;
      cnt += 1;
    }
  }
  for (long long int i = 0; i <= mx; i++) {
    k1 = k;
    cnt = 0;
    for (long long int j = 0; j <= 60 && k1 > 0; j++) {
      d = min(k1, br[i][j]);
      cnt += d * j;
      k1 -= d;
    }
    if (k1 == 0) ans = min(ans, cnt);
  }
  cout << ans << "\n";
  return 0;
}
