#include "ricehub.h"
#include<bits/stdc++.h>
#define fi first
#define se second
//#define int long long
using namespace std;
using db=double;
using ll=int64_t;
using sll=__int128;
using lb=long double;
int besthub(int r, int l, int x[], long long b){
int ans=0;
for(int i=1; i<=l; i++){
vector<int>v; ll rem=b; int cur=0;
for(int j=0; j<r; j++){
v.push_back(abs(i-x[j]));
}
sort(v.begin(),v.end());
for(auto x:v){
if(rem>=x){
rem-=x; cur++;
}
}
ans=max(ans,cur);
}
return ans;
}
# | 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... |