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>
using namespace std;
const int N = 1e5+5;
int a[N], n;
long long b;
int check(int pos){
vector<int> v;
for(int i=0;i<n;i++){
v.push_back(abs(a[i]-pos));
}sort(v.begin(), v.end());
int i=0;
long long B = b;
int cnt = 0;
while(i < n && B >= 0){
if(v[i] > B)break;
B -= (long long)v[i], i++;
cnt++;
}return cnt;
}
int besthub(int R, int L, int X[], long long B){
n = R;
b = B;
for(int i=0;i<n;i++)a[i] = X[i];
int ans = 0;
for(int i=0;i<n;i++){
ans = max(check(a[i]), ans);
}
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... |