| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 307772 | amunduzbaev | 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 "ricehub.h"
#include <bits/stdc++.h>
#include "grader.cpp"
using namespace std;
#define ll long long
int n,l,b,a[10005];
int fun(int x){
vector<int>v(n);
for(int i=0;i<n;i++){
v[i]=(abs(a[i]-x));
}
sort(v.begin(),v.end());
ll s=0;
for(int i=0;i<n;i++){
if(s+v[i]>b)
return i;
s+=v[i];
}
return n;
}
int besthub(int N, int L, int x[], ll B)
{
n=N, l=L, b=B;
int ans=0;
for(int i=0;i<n;i++){
a[i]=x[i];
}
for(int i=0;i<n;i++){
ans=max(fun(a[i]),ans);
}
return ans;
}
