#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5, MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, sum = 0;
cin >> n;
vector<ll> ans(n);
vector<array<ll, 2>> vec;
for(int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
vec.push_back({b, i});
sum += a;
}
sort(vec.rbegin(), vec.rend());
for(int i = 0; i < n and sum; i++)
{
ll a = min(sum, vec[i][0]);
sum -= a;
ans[vec[i][1]] = a;
}
int cnt = 0;
for(int i = 0; i < n; i++)
{
if(ans[i] == 0)
cnt++;
}
cout << cnt << '\n';
for(int i = 0; i < n; i++)
cout << ans[i] << " ";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
344 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 |
0 ms |
348 KB |
Output is correct |