#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;

int main() {
	pair<int, int> p[200001];
	int n, idx=0;
	long long now=0;
	cin>>n; for(int i=0;i<n;i++){
		int a, b; cin>>a>>b;
		p[i]=make_pair(b,a);
	}
	sort(p,p+n);
	while(idx<n){
		now+=p[idx].second;
		if(now>p[idx].first) break;
		idx++;
	}
	if(idx==n) cout<<"Yes";
	else cout<<"No";
	
	return 0;
}