# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383357 | Iwanttobreakfree | Rice Hub (IOI11_ricehub) | C++17 | 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 <vector>
#include <algorithm>
using namespace std;
int besthub(int R, int L, int X[], long long B){
vector<int> v(R);
for(int i=0;i<R;i++)v[i]=x[i];
sort(v.begin(),v.end());
int l=0,r=R,maxi=0;
while(l<=r){
int mid(r-l)/2+l;
long long int i=mid+1,sum=0,c=0;
while(i<R&&sum<B){
sum+=v[i]-v[mid];
i++;
c++;
}
if(c>maxi){
maxi=c;
r=mid-1;
}
else l=mid+1;
}
return maxi;
}