#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<pair<int,int>>tmp(N);
    for(int i = 0; i < N; i++) {
        cin >> tmp[i].first >> tmp[i].second;
    }
    sort(tmp.begin(),tmp.end(),[](auto x,auto y) {
        if(min(x.second,y.second-x.first) < min(y.second,x.second-y.first)) {
            return false;
        }
        return true;
    });
    long long sum = 0;
    for(int i = 0; i < N; i++) {
        if(sum > tmp[i].second) {
            cout << "No" << endl;
            return 0;
        }
        sum += tmp[i].first;
    }
    cout << "Yes" << endl;
}