Submission #744086

#TimeUsernameProblemLanguageResultExecution timeMemory
744086vjudge1Rice Hub (IOI11_ricehub)C++17
42 / 100
1080 ms812 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=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;
        long long 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...