#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int,int> > v;
long long sm = 0;
for(int i = 0; i < n; i ++)
{
int z, t;
cin >> t >> z;
v.push_back({z, i});
sm += t;
}
sort(v.rbegin(), v.rend());
int ans[n] = {};
for(auto [z, i] : v)
{
ans[i] = min(z * 1ll, sm);
sm -= min(z * 1ll, sm);
}
cout << count(ans, ans + n, 0) << endl;
for(int i = 0; i < n; i ++)
cout << ans[i] << ' ';
cout << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 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 |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
456 KB |
Output is correct |