func_code_string: #include <bits/stdc++.h>   using namespace std;   long long n, k;   void search(int cur) {     int tot, c[10];     int ok;     if (cur == n)       tot++;     else       for (int i = 0; i < n; i++) {         ok = 1;         c[cur] = i;       }     for (int j = 0; j < cur; j++) {       if (c[cur] == c[j] || cur - c[cur] == j - c[j] ||           cur + c[cur] == j + c[j]) {         ok = 0;         break;       }     }     if (ok) search(cur + 1);   }   const long long MAXN = 55;   long long num[MAXN];   void xswl() {     scanf( %lld%lld , &n, &k);     for (long long i = 1; i <= n; ++i) {       scanf( %lld , &num[i]);     }     num[0] = 1;     sort(num + 1, num + 1 + n);     long long res = 999999999999999;     for (long long i = 2e5; i >= 0; --i) {       long long cnt = 0;       long long nowr = 0;       int t = lower_bound(num + 1, num + 1 + n, i) - num;       for (int j = t; j <= n; ++j) {         long long now = 0;         long long u = num[j];         while (u > i) {           ++now;           u >>= 1;         }         if (u == i) {           ++cnt;           nowr += now;         }         if (cnt == k) break;       }       if (cnt == k) {         if (res > nowr) {           res = nowr;         }       }     }     printf( %lld , res);   }   int main() { xswl(); }   