# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409890 | 2021-05-21T18:35:20 Z | Dan4Life | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long ll besthub(ll n, ll m, ll 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; } int main() { ll n, m, a[100], k; cin >> n >> m >> k; for(int i = 0; i < n; i++) cin >> a[i]; cout << besthub(n,m,a,k); }