#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif
using namespace std;
const bool __initialization = []() {
cin.tie(nullptr)->sync_with_stdio(false);
cout << setprecision(12) << fixed;
return true;
}();
using ll = long long;
using ld = long double;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)
template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }
constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;
// =============================================================================
constexpr int maxn = 1e5 + 5;
#include "ricehub.h"
int n, len;
ll budget;
int a[maxn];
int option[maxn];
int besthub(int _R, int _L, int _X[], ll _B) {
// globalization
n = _R; len = _L; budget = _B;
For (i, 1, n) a[i] = _X[i - 1];
// end of globalization
int ans = 0;
For (p, 1, n) {
For (i, 1, n) {
option[i] = abs(a[i] - a[p]);
}
sort(option + 1, option + n + 1);
ll cost = budget;
int cnt = 0;
For (i, 1, n) {
if (cost < option[i]) break;
cost -= option[i];
++cnt;
}
chmax(ans, cnt);
}
return ans;
}
// wait this could still get TLE...
// and I'm not even sure if this will be correct...
// iirc this IOI was offline
