#include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define int long long
using namespace std;
const int inf = 2e18 + 5;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int32_t main(){
//freopen("in.txt","r", stdin);
int n;
cin>>n;
vector<pair<int,int> > g(n);
int s = 0;
for(int i = 0; i < n; i++){
int x, y;
cin>>x>>y;
s += x;
g[i] = {y, i};
}
sort(g.rbegin(), g.rend());
vector<int> ans(n);
int cnt = 0;
for(int i = 0; i < n; i++){
if(s > g[i].first){
cnt++;
ans[g[i].second] = g[i].first;
s -= g[i].first;
}
else{
cnt++;
ans[g[i].second] = s;
break;
}
}
cout<<n - cnt<<endl;
for(auto itr: ans) cout<<itr<<" ";
cout<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 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 |
384 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 |
348 KB |
Output is correct |