Submission #537603

#TimeUsernameProblemLanguageResultExecution timeMemory
537603timreizinRice Hub (IOI11_ricehub)C++17
68 / 100
1092 ms1456 KiB
#include "ricehub.h" #include <vector> #include <algorithm> using namespace std; using ll = long long; int besthub(int r, int l, int X[], ll b) { vector<ll> x(r); for (int i = 0; i < r; ++i) x[i] = X[i]; int maxRes = 0; for (int i = 0; i < r; ++i) { vector<ll> sorted; for (int j = 0; j < r; ++j) sorted.push_back(abs(x[i] - x[j])); sort(sorted.begin(), sorted.end()); int res = 0; ll sum = 0; for (int j = 0; j < r; ++j) { if (sum + sorted[j] > b) break; sum += sorted[j]; ++res; } maxRes = max(maxRes, res); } return maxRes; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...