#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
long long int n, k, a[200005], dp[200005];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k;
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (long long int i = 1; i <= n; i++) dp[i] = dp[i - 1] + a[i];
  long long int i = 1, ans = -1;
  while (i <= n) {
    long long int j = i;
    while (j + 1 <= n && a[j + 1] == a[j]) {
      j++;
    }
    long long int cnt = j - i + 1;
    if (cnt >= k) {
      ans = 0;
      break;
    }
    long long int cur = 1e18;
    long long int s1 = i - 1;
    long long int s2 = n - j;
    long long int ans1 = 0, ans2 = 0;
    ans1 = s1 * (a[i] - 1) - dp[i - 1] + dp[0];
    ans2 = dp[n] - dp[j] - s2 * (a[i] + 1);
    if (s2 + cnt >= k) {
      cur = min(cur, ans2);
    }
    if (s1 + cnt >= k) {
      cur = min(cur, ans1);
    }
    cur = min(cur, ans1 + ans2);
    cur = cur + k - cnt;
    if (ans == -1) {
      ans = cur;
    } else
      ans = min(ans, cur);
    i = j + 1;
  }
  cout << ans << '\n';
}
