# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336074 | saarang123 | 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 <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int N, int L, int A[], int B) {
int median;
if(N % 2) median = A[N / 2];
else median = (A[N / 2 - 1] + A[N / 2]) / 2;
vector<int> distance;
for(int i = 0; i < N; i++)
distance.push_back(abs(A[i] - median));
sort(distance.begin(), distance.end());
int answer = 0;
long long cost = 0;
for(int i = 0; i < N; i++)
if(cost + distance[i] <= B) {
cost += distance[i];
answer++;
}
return answer;
}