# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407245 | danielcm585 | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int besthub(int N, int L, int X[], ll B){
sort(X,X+N);
int ans = 0;
vector<int> v;
for (int i = 0; i < N; i++) v.push_back(abs(X[i]-X[N/2]));
sort(v.begin(),v.end());
for (int i : v) {
if (B < i) break;
ans++;
B -= i;
}
return ans;
}