#include "ricehub.h"
#include <algorithm>
#include <cstdlib>
#include <set>
#include <vector>
using namespace std;
int besthub(int R, int L, int X[], long long B) {
int ans = 0;
for (int i = 0; i < R; i++) {
// chooce rice hub
int tempB = B;
vector <int> s;
s.reserve (R + 1);
for (int j = 0; j < R; j++)
s.emplace_back (abs (X[i] - X[j]));
sort (s.begin(), s.end());
int curans = 0;
for (int i = 0; i < s.size(); i++) {
if (tempB < s[i])
break;
tempB -= s[i];
curans++;
}
ans = max (curans, ans);
}
return ans;
}
