#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a, sum;
ll query(int l, int r) {
l++, r++;
return sum[r]-sum[l-1];
}
bool can(ll B, int l, int r) {
int p = (l+r)/2;
return a[p]*(p-l+1)-query(l,p) + query(p+1,r)-a[p]*(r-p) <= B;
}
int besthub(int R, int L, int X[], ll B) {
int ans = 0;
sort(X,X+R);
sum.push_back(0);
for (int i = 0; i < R; i++) {
a.push_back(X[i]);
sum.push_back(sum.back()+X[i]);
}
for (int i = 0; i < R; i++) {
for (int l = i, r = R-1; l <= r; ) {
int mid = (l+r)/2;
if (can(B,i,mid)) {
ans = max(ans,mid-i+1);
l = mid+1;
}
else r = mid-1;
}
}
return ans;
}
