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;
int besthub(int R, int L, int X[], long long B)
{
int mx = -1;
for(int i=0;i<=R;++i)
{
priority_queue<long long,vector<long long>,greater<long long>> pq;
for(int j=0;j<R;++j)
{
long long dist = abs(X[i]-X[j]);
pq.push(dist);
}
long long cost = 0;
int rice = 0;
while(!pq.empty())
{
if(cost+pq.top() <= B)
{
cost += pq.top();
++rice;
}
else break;
pq.pop();
}
mx = max(mx,rice);
}
return mx;
}
| # | 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... |