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 <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int besthub(int r, int l, int X[], ll b)
{
vector<ll> x(r);
for (int i = 0; i < r; ++i) x[i] = X[i];
int maxRes = 0;
for (int i = 0; i < r; ++i)
{
vector<ll> sorted;
for (int j = 0; j < r; ++j) sorted.push_back(abs(x[i] - x[j]));
sort(sorted.begin(), sorted.end());
int res = 0;
ll sum = 0;
for (int j = 0; j < r; ++j)
{
if (sum + sorted[j] > b) break;
sum += sorted[j];
++res;
}
maxRes = max(maxRes, res);
}
return maxRes;
}
# | 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... |