#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int n, int m, int arr[], long long k) {
vector<int> a(n);
for (int i = 0; i < n; i++) {
a[i] = arr[i];
}
vector<vector<int>> d(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = abs(a[i] - a[j]);
}
sort(d[i].begin(), d[i].end());
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
long long sum = 0;
for (int j = 0; j < n; j++) {
if (sum + d[i][j] <= k) {
sum += d[i][j];
cnt++;
}
}
ans = max(ans, cnt);
}
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... |