#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1000;
int n, a[mxN], cap[mxN], ind[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i) cin >> a[i] >> cap[i];
ll tot=accumulate(a, a+n, 0ll);
iota(ind, ind+n, 0);
sort(ind, ind+n, [](int x, int y) {return cap[x]<cap[y];});
for (int i=n-1; ~i; --i) {
int cur=ind[i];
int x=min(tot, (ll)cap[cur]);
a[cur]=x;
tot-=x;
}
int ans=count(a, a+n, 0);
cout << ans << "\n";
for (int i=0; i<n; ++i) cout << a[i] << " ";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
360 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
396 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 |