Submission #6064083

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n;
    cin>>n;
    int a[n],b[n];
    rep(i,n){
        cin>>a[i]>>b[i];
        a[i]=b[i]-a[i];
    }
    vector<int> ord(n);
    iota(ord.begin(),ord.end(),0);
    sort(ord.begin(),ord.end(),[&](int x,int y){
        return b[x]<b[y];
    });
    int cur = 0;
    for(auto i:ord){
        if(cur>a[i]){
            cout<<"No"<<endl;
            return 0;
        }
        cur += b[i]-a[i];
    }
    cout<<"Yes"<<endl;
    return 0;
}

Submission Info

Judge Result