#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int n, place, cap;
vector<int> v;
bool cmp(int a, int b) {
return abs(a-place) < abs(b-place);
}
int calc(int x) {
place = x;
sort(v.begin(),v.end(),cmp);
int have = cap, ret = 0;
for(int i = 0; i < n; i++) {
if(abs(v[i]-x) > have) break;
have -= abs(v[i]-x);
ret++;
} return ret;
}
int besthub(int R, int L, int X[], long long B)
{
n = R; cap = B;
for(int i = 0; i < R; i++) v.push_back(X[i]);
int lo = 0, hi = L;
while(hi - lo >= 10) {
int mid1 = (lo + lo + hi)/3;
int mid2 = (lo + hi + hi)/3;
int got1 = calc(mid1), got2 = calc(mid2);
if(got1 > got2) hi = mid2 - 1;
else lo = mid1 + 1;
}
int ret = 0;
for(int i = lo; i <= hi; i++)
ret = max(ret , calc(i));
return ret;
}
