#include <bits/stdc++.h>
#include "ricehub.h"
using ll = long long;
using namespace std;
int besthub(int n, int l, int x[], ll b){
ll val=b, i;
vector<ll> v;
for(i=0; i<n; i++)v.push_back(abs(x[i]-x[n/2]));
sort(v.begin(), v.end());
for(i=0; i<n; i++){
if(val<v[i])break;
val-=v[i];
}
ll ans=i;
if(n%2==0){
v.clear();
for(i=0; i<n; i++)v.push_back(abs(x[i]-x[(n+1)/2]));
sort(v.begin(), v.end());
val=b;
for(i=0; i<n; i++){
if(val<v[i])break;
val-=v[i];
}
ans=max(ans, i);
}
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... |