#include "ricehub.h"
#include <bits/stdc++.h>
// author : aykhn
using namespace std;
typedef long long ll;
#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F
int besthub(int n, int l, int x[], long long b)
{
int ans = 1;
for (int i = 0; i < n; i++)
{
vector<int> v;
for (int j = 0; j < n; j++)
{
v.pb(abs(x[j] - x[i]));
}
sort(all(v));
int cnt = 0;
int sum = 0;
for (int j = 0; j < n; j++)
{
if (sum + v[j] <= b)
{
cnt++;
sum += v[j];
}
else break;
}
ans = max(ans, cnt);
}
return ans;
}
