#include <bits/stdc++.h>
using namespace std;
long long n, m, mn = 999999999, x;
long long p[200009][20];
void solve() {
  cin >> n >> m;
  for (long long i = 0; i < n; i++) {
    cin >> x;
    int z = 0;
    while (x > 0) {
      p[x][z]++;
      z++;
      x /= 2;
    }
  }
  for (long long i = 1; i < 200009; i++) {
    long long y = m, an = 0;
    for (long long j = 0; j < 20; j++) {
      if (p[i][j] < y)
        y -= p[i][j], an = an + j * p[i][j];
      else {
        an = an + j * y;
        y = 0;
        break;
      }
    }
    if (y == 0) mn = min(mn, an);
  }
  cout << mn;
}
int main() {
  long long t = 1;
  while (t--) solve();
}
