Submission #743253

#TimeUsernameProblemLanguageResultExecution timeMemory
743253vjudge1Rice Hub (IOI11_ricehub)C++17
0 / 100
1063 ms640 KiB
#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    long long mx = -1;
    for(int i=1;i<=R;++i)
    {
        int pos = X[i];
        priority_queue<int,vector<int>,greater<int>> pq;
        for(int j=0;j<R;++j)
        {
            int dist = abs(pos-X[j]);
            pq.push(dist);
        }
        long long cost = 0,rice = 0;
        while(!pq.empty() && cost < B)
        {
            cost += pq.top();
            ++rice;
            pq.pop();
        }
        mx = max(mx,rice);
    }
    return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...