#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  map<int, int> cnt;
  for (int i = 0, x; i < n; ++i) {
    cin >> x;
    cnt[x] += 1;
  }
  vector<pair<int, int>> a;
  for (auto p : cnt) {
    a.push_back(p);
  }
  vector<pair<LL, int>> cl(a.size()), cr(a.size());
  LL sum = 0, cc = 0;
  for (int i = 0; i < a.size(); ++i) {
    auto [x, y] = a[i];
    cl[i] = {cc * (x - 1) - sum, cc};
    sum += 1LL * x * y;
    cc += y;
  }
  sum = 0;
  cc = 0;
  for (int i = (int)a.size() - 1; i >= 0; --i) {
    auto [x, y] = a[i];
    cr[i] = {sum - cc * (x + 1), cc};
    sum += 1LL * x * y;
    cc += y;
  }
  LL ans = numeric_limits<LL>::max();
  for (int i = 0; i < (int)a.size(); ++i) {
    if (a[i].second >= k) {
      ans = 0;
      break;
    }
    if (a[i].second + cl[i].second >= k) {
      ans = min(ans, cl[i].first + k - a[i].second);
    }
    if (a[i].second + cr[i].second >= k) {
      ans = min(ans, cr[i].first + k - a[i].second);
    }
    ans = min(ans, cl[i].first + cr[i].first + k - a[i].second);
  }
  cout << ans << '\n';
}
