#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<pair<int, int>, int>> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first.second >> a[i].first.first;
a[i].second = i;
sum += a[i].first.second;
}
sort(a.rbegin(), a.rend());
vector<int> ans(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
long long k = min(sum, (long long) a[i].first.first);
ans[a[i].second] = k;
sum -= k;
if (k != 0) {
cnt++;
}
}
cout << n - cnt << '\n';
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |