#include "ricehub.h" #include "iostream" #include "vector" #include "map" #include "math.h" #include "string" #include "algorithm" #include "set" #include <iterator> #include <string.h> #include <queue> #include <list> using namespace std; typedef long long ll ; const ll M = 998244353 ; const ll oo = 1e13 ; multiset<int> s ; int besthub(int R, int L, int X[], long long B){ int ans = 0 ; for(int i = 0 ; i < R ; ++i){ int md = (X[i] + X[R - 1]) / 2 , co = 0 ; ll cost = 0 ; s.clear(); for(int j = 0 ; j < R ; ++j){ s.insert(abs(md - X[j])); } for(auto x : s){ cost += x ; if(cost > B){ break; } co++; } ans = max(ans , co); } return ans; }