#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, k;
ll v[200002];
ll s[200001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> v[i];
  sort(v + 1, v + 1 + n);
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] + v[i];
  ll ans = 1e14;
  for (ll i = 1; i <= n; i++) {
    ll j = i;
    while (v[j] == v[j + 1]) j++;
    ll fr = j - i + 1;
    if (fr >= k) {
      cout << "0";
      return 0;
    }
    if (i - 1 >= k - fr) {
      ll cost = (i - 1) * (v[i] - 1) - s[i - 1];
      cost += k - fr;
      ans = min(ans, cost);
    }
    if (n - j >= k - fr) {
      ll cost = s[n] - s[j] - (n - j) * (v[i] + 1);
      cost += k - fr;
      ans = min(ans, cost);
    }
    ll cost = (s[n] - s[j] - (n - j) * (v[i] + 1)) +
              ((i - 1) * (v[i] - 1) - s[i - 1]);
    cost += k - fr;
    ans = min(ans, cost);
    i = j;
  }
  cout << ans;
  return 0;
}
