# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1236277 | mathias_abadie | 쌀 창고 (IOI11_ricehub) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, const vector<int>& X, long long B) {
int maxRice = 0;
for (int hub = 1; hub <= L; ++hub) {
vector<long long> costs;
for (int i = 0; i < R; ++i) {
costs.push_back(abs((long long)X[i] - hub));
}
sort(costs.begin(), costs.end());
long long totalCost = 0;
int count = 0;
for (int i = 0; i < R; ++i) {
totalCost += costs[i];
if (totalCost <= B) {
count++;
} else {
break;
}
}
maxRice = max(maxRice, count);
}
return maxRice;
}