#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long int besthub(int n, int m, int a[], ll k) { ll ans = 0; for(int i = 0; i < n; i++){ multiset<int> S; S.clear(); for(int j = 0; j < n; j++) S.insert(abs(a[i]-a[j])); ll K = k, cnt = 0; while(!S.empty() and K>=(*S.begin())) cnt++, K-=(*S.begin()), S.erase(S.begin()); if(ans<cnt)ans=cnt; } return ans; }