Submission #1249352

#TimeUsernameProblemLanguageResultExecution timeMemory
1249352_HDHRice Hub (IOI11_ricehub)C++20
0 / 100
0 ms324 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int min_pos = INT_MAX, min_sum = INT_MAX; for (int j = 1; j <= L; j++){ int sum = 0; for (int i = 0; i < R; i++){ sum += abs(X[i] - j); } if (sum < min_sum){ min_sum = sum; min_pos = j; } } vector<int> vt; for (int i = 0; i < R; i++){ vt.push_back(abs(X[i] - min_pos)); } int ans = 0, sum = 0; sort(vt.begin(), vt.end()); while (ans < vt.size() && sum + vt[ans] <= B) sum += vt[ans++]; 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...