# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799430 | 2023-07-31T14:13:55 Z | Liudas | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int N, int L, vector<int> arr, int B){ vector<int> brr = arr; int best = 0; for(int i = 0; i <= L; i ++){ int T = B, ans = 0; sort(brr.begin(), brr.end(), [&](int a, int b){return abs(a-i) < abs(b-i);}); for(int j : brr){ if(abs(j-i) > T)break; ans ++; T -= abs(j-i); } best = max(best, ans); } return best; }