Submission #743305

#TimeUsernameProblemLanguageResultExecution timeMemory
743305vjudge1Rice Hub (IOI11_ricehub)C++17
42 / 100
1072 ms1056 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<=L;++i) { priority_queue<long long,vector<long long>,greater<long long>> pq; for(int j=0;j<R;++j) { long long dist = abs(i-X[j]); pq.push(dist); } long long cost = 0,rice = 0; while(!pq.empty()) { // cout << "+" << pq.top() << '\n'; 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...