# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519666 | KoD | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 332 KiB |
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 <bits/stdc++.h>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
std::cin >> N;
long long sum = 0;
vector<pair<int, int>> vol(N);
for (int i = 0; i < N; ++i) {
int in;
std::cin >> in >> vol[i].first;
vol[i].second = i;
sum += in;
}
std::sort(vol.rbegin(), vol.rend());
vector<int> ans(N);
for (const auto& [x, i] : vol) {
if (sum >= x) {
sum -= x;
ans[i] = x;
} else {
ans[i] = sum;
break;
}
}
std::cout << std::count(ans.begin(), ans.end(), 0) << '\n';
for (int i = 0; i < N; ++i) {
std::cout << ans[i] << " \n"[i + 1 == N];
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |