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 R, int L, int X[], long long B){
int ans=0;
for(int i=1;i<=R;i++){
vector<int>v;
for(int j=1;j<=R;j++){
v.push_back(abs(X[j]-X[i]));
}
sort(v.begin(),v.end());
int u=0;
int c=0;
for(auto it:v){
c+=it;
if(c>B)break;
u++;
}
ans=max(ans,u);
}
return ans;
}
/*
signed main(){
int X[4]={0,10,12,14};
cout<<besthub(3,14,X,6);
}*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |