Submission #690237

#TimeUsernameProblemLanguageResultExecution timeMemory
690237zeroesandonesRice Hub (IOI11_ricehub)C++17
42 / 100
1078 ms992 KiB
#include "bits/stdc++.h" #include "ricehub.h" using namespace std; using ll = long long; using vi = vector<long long>; #define pb emplace_back ll check(int x, int R, int X[], ll B) { vi cost; for(int i = 0; i < R; ++i) { cost.pb(abs(X[i] - x)); } sort(cost.begin(), cost.end()); ll cnt = 0; ll sum = 0; for(int i = 0; i < (int) cost.size(); ++i) { if(sum + cost[i] > B) return cnt; ++cnt; sum += cost[i]; } return cnt; } int besthub(int R, int L, int X[], long long B) { ll ans = 0; for(int i = 0; i <= L; ++i) { ans = max(ans, check(i, R, X, B)); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...