#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    vector<int> ind(n);
    ll a[100100], b[100010];
    for(int i=0; i<n; i++){
        cin>>a[i]>>b[i];
        ind[i]=i;
    }
    sort(ind.begin(), ind.end(), [&](int i, int j){ return a[i]+b[i]<a[j]+b[j];});
    ll s=0;
    for(auto i:ind){
        if(s>b[i]){
            cout<<"No"<<endl;
            return 0;
        }
        s+=a[i];
    }
    cout<<"Yes"<<endl;
    return 0;
}