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;
typedef long long ll;
const int MAXN=1e5+3;
int v[MAXN];
int n, m;
ll x;
int testa(ll k) {
vector<int> aux;
for(int i=0; i<n; i++) aux.push_back(abs(v[i]-k));
sort(aux.begin(), aux.end());
int soma=0; int resp=0;
for(auto cur : aux) {
if(soma+cur<=x) {
soma+=cur;
resp++;
}
else {
break;
}
}
return resp;
}
int besthub(int N, int M, int V[], ll X)
{
n=N; m=M; x=X;
for(int i=0; i<n; i++) v[i]=V[i];
int resp=0;
for(int i=0; i<=m; i++) resp=max(resp, testa(i));
return resp;
}
| # | 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... |