#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fi first
#define se second

using std::cin;
using std::cout;
using std::pair;
using std::vector;
using ll = long long;
using P = pair<ll, ll>;

int main() {
	int n;
	cin >> n;
	
	vector<P> a(n);
	rep(i, n) cin >> a[i].first >> a[i].se;
	
	sort(a.begin(), a.end(), [&](P c,  P d) {
		return c.fi + c.se < d.fi + d.se;
	});
	
	ll s = 0;
	bool ok = true;
	rep(i, n) {
		if (a[i].se < s) ok = false;
		s += a[i].fi;
	}
	
	cout << (ok ? "Yes\n" : "No\n");
	
	return 0;
}