#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m;
  cin >> n >> m;
  vector<long long> theval(n, 0);
  long long sum = 0, output = 100000000000000000, leen = 1;
  vector<long long> prefix(n + 10, 0);
  for (int i = 0; i < n; i++) {
    cin >> theval[i];
    sum += theval[i];
  }
  sort(theval.begin(), theval.end());
  for (int i = 1; i < n; i++) {
    if (theval[i] == theval[i - 1])
      leen++;
    else
      leen = 1;
    if (leen >= m) {
      cout << 0 << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    prefix[i] += theval[i];
    if (i == 0) continue;
    prefix[i] += prefix[i - 1];
  }
  for (int i = 0; i < n; i++) {
    long long ans1 = 100000000000000000, ans2 = 100000000000000000,
              ans3 = 100000000000000000;
    if (i >= m - 1) {
      ans1 = (i * (theval[i] - 1) - (prefix[i] - theval[i])) + m - 1;
    }
    if (n - i - 1 >= m - 1) {
      ans2 = (sum - prefix[i] - (n - i - 1) * (theval[i] + 1)) + m - 1;
    }
    ans3 = (i * (theval[i] - 1) - (prefix[i] - theval[i])) +
           (sum - prefix[i] - (n - i - 1) * (theval[i] + 1)) + m - 1;
    output = min(output, min(ans1, min(ans2, ans3)));
  }
  cout << output << endl;
}
