#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
vector <ll> arr;
ll RO(ll budget, ll cord) {
priority_queue <ll, vector <ll>, greater <ll> > pq;
for (ll x : arr) pq.push(abs(x-cord));
ll paks = 0, suma = 0;
while (!pq.empty() && suma <= budget) {
ll curr = pq.top();
pq.pop();
if (suma + curr <= budget) suma += curr, paks++;
else break;
}
return paks;
}
int besthub(int R, int L, int X[], ll B) {
for (ll i=0; i<R; i++) arr.push_back((ll)X[i]);
ll maxi = 0;
for (ll i=1; i<=L; i++) {
maxi = max(maxi, RO(B, i));
}
return maxi;
}
