# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261575 | c4ts0up | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <ll> arr;
ll RO(ll budget, ll cord) {
priority_queue <ll, vector <ll>, greater <ll> > pq;
for (ll x : arr) pq.push(abs(x-cord));
ll paks = 0, suma = 0;
while (!pq.empty() && suma <= budget) {
ll curr = pq.top();
pq.pop();
if (suma + curr <= budget) suma += curr, paks++;
else break;
}
return paks;
}
ll besthub(int R, int L, int X[], ll B) {
for (ll i=0; i<R; i++) arr.push_back((ll)X[i]);
ll maxi = 0;
for (ll i=1; i<=L; i++) {
maxi = max(maxi, RO(B, i));
}
return maxi;
}