#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
for (int j = 1; j <= L; j++){
vector<int> vt;
for (int i = 0; i < R; i++){
vt.push_back(abs(X[i] - j));
}
sort(vt.begin(), vt.end());
int sum = 0;
int k = 0;
while (k < vt.size() && sum + vt[k] <= B)
sum += vt[k++];
ans = max(ans, k);
}
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... |