#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=155550555555555;
ll mod=1000000007;
int main(){
    ll n;
    cin >> n;
    vector<ll>a(n),b(n);
    priority_queue<pair<ll,ll>>pq;
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i]>> b[i];
        pq.push({-a[i]-b[i],i});
    }
    vector<ll>c;
    while (!pq.empty())
    {
        c.push_back(pq.top().second);
        pq.pop();
    }
    ll ans=0;
    for (ll i = 0; i < n; i++)
    {
        if (ans>b[c[i]])
        {
            cout << "No" << endl;
            return 0;
        }
        ans+=a[c[i]];
    }
    cout << "Yes" << endl;
}