#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;cin>>N;
vector<ll> T(N);
vector<pair<ll,int>> Z;
for(int i=0;i<N;i++){
cin>>T[i];
ll x;cin>>x;Z.push_back(make_pair(x,i));
}
ll m = accumulate(T.begin(),T.end(),0);
sort(Z.begin(),Z.end(),greater<pair<ll,int>>());
bool flag = true;
for(int i=0;i<N;i++){
ll dec = min(get<0>(Z[i]),m);
Z[i] = make_pair(dec,get<1>(Z[i]));
m-=dec;
if(m==0 && flag){cout<<N-i-1<<endl;flag=false;}
}
vector<ll> ZR(N);
for(int i=0;i<N;i++){
ZR[get<1>(Z[i])]=get<0>(Z[i]);
}
for(auto &i:ZR)cout<<i<<" ";
}
