#include <bits/stdc++.h>
using namespace std;
const int N = 1e6, INF = 1e9 + 7;
int n, k, a[N];
vector<pair<int, int> > g;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    g.push_back(make_pair(a[i], 0));
    int c = 1;
    while (a[i] > 0) {
      g.push_back(make_pair(a[i] / 2, c));
      c++, a[i] /= 2;
    }
  }
  int ans = INF;
  sort(g.begin(), g.end());
  for (int i = 0, sum = 0, j = 0; i < (int)g.size(); i++) {
    if (i == 0 || g[i].first != g[i - 1].first) {
      sum = g[i].second, j = 1;
    } else {
      j += 1, sum += g[i].second;
    }
    if (j == k) {
      ans = min(ans, sum);
    }
  }
  cout << ans;
}
