#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 200005
#define int long long
const int modulo = 1e9 + 7;
int32_t main()
{
fastio();
int n;
cin>>n;
vector<pii> g;
int sum = 0;
vector<int> ans(n + 5, 0);
for (int i = 1; i <= n; i++){
int t, z;
cin>>t>>z;
sum += t;
g.pb({z, i});
}
sort(g.rbegin(), g.rend());
int it = 0;
while(it < n && sum > 0){
int diff = min(g[it].st, sum);
sum -= diff;
ans[g[it].nd] = diff;
it++;
}
cout<<n - it<<endl;
for (int i = 1; i <= n; i++){
cout<<ans[i]<<sp;
}
cout<<endl;
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}
# |
Verdict |
Execution time |
Memory |
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 |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
600 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 |
348 KB |
Output is correct |