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 <bits/stdc++.h>
#include <ricehub.h>
using namespace std;
using ll = long long;
int besthub(int r, int l, int x[], ll b){
ll ans = 0;
for(int i = 0; i < r; i++){
priority_queue<ll>pq;
ll cost = 0;
ll tmp = 0;
for(int j = 0; j < r; j++){
ll a = abs(x[j] - x[i]);
if(cost + a <= b){
pq.push(a);
cost += a;
tmp++;
} else if(!pq.empty() && pq.top() > a){
cost -= pq.top(); pq.pop();
cost += a;
pq.push(a);
}
}
ans = max(ans, tmp);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |