#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n,sum = 0;cin >> n;
int z[n];memset(z , 0 , sizeof(z));
pair < int , int > glass[n];
for(int i = 0;i<n;i++){
int x;cin >> x;
sum += x;
cin >> x;
glass[i] = {x,i};
}
sort(glass , glass + n);
reverse(glass , glass + n);
for(int i = 0;i<n;i++){
int diff = min(sum , glass[i].first);
sum -= diff;
z[glass[i].second] += diff;
}
int ans = 0;
for(int i = 0;i<n;i++)ans += z[i] == 0;
cout << ans << endl;
for(int i = 0;i<n;i++){
cout << z[i] << " ";
}
cout << endl;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int testcase = 1;//cin >> testcase;
while(testcase--)solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |