using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;


class Program {

	static long mod = 998244353;
	static int[] ans;
	static void Main(string[] args) {

		char[] cs = new char[] { ' ' };
		//char[] cs = new char[] { ' ', ',' };

		//int n = int.Parse(Console.ReadLine());
		//int val = int.Parse(Console.ReadLine());
		//int[] vals = parseAry(Console.ReadLine().Split(cs));
		//string str = Console.ReadLine();
		//string[] strs = Console.ReadLine().Split(cs);


		string res = "Yes";
		int n = int.Parse(Console.ReadLine());
		int[] cost = new int[n];
		int[] limit = new int[n];
		PriorityQueue pq = new PriorityQueue();

		List<KeyValuePair<int, int>> ppp = new List<KeyValuePair<int, int>>();

		for ( int i = 0; i < n; i++ ) {
			int[] vals = parseAry(Console.ReadLine().Split(cs));
			ppp.Add(new KeyValuePair<int, int>(vals[1], vals[0]));
		}
		List<KeyValuePair<int, int>> pairs = new List<KeyValuePair<int, int>>(ppp);

		// List.Sortメソッドを使ってソート
		// (引数に比較方法を定義したメソッドを指定する)
		pairs.Sort(CompareKeyValuePair);

		int now = 0;
		for ( int i = 0; i < n; i++ ) { 
			KeyValuePair<int, int> tk=pairs[i];
			now += tk.Value;
			if ( now > tk.Key ) { res = "No"; }

		}

			Console.WriteLine(res);
				return;

	}


	static int CompareKeyValuePair(KeyValuePair<int, int> x, KeyValuePair<int, int> y) {
		if ( x.Key < y.Key ) { return -1; }
		if ( x.Key == y.Key ) { return 0; }
		if ( x.Key > y.Key ) { return 1; }
		return 0;
	}

	public class PriQ {
		public int rank { get; set; }
		public string rankstr { get; set; }
		public int num { get; set; }
		public int[] nums { get; set; }
		public Object obj { get; set; }
		public PriQ() { }
	}

	public class PriorityQueue {
		List<PriQ> list = new List<PriQ>();
		public PriorityQueue() { }
		public PriorityQueue(PriQ p) { list.Add(p); }
		public void Enqueue(PriQ item) { list.Insert(Binary_Search(item), item); }
		public PriQ Dequeue() { PriQ r = list[0]; list.RemoveAt(0); return r; }
		public PriQ DequeueLast() { PriQ r = list[list.Count - 1]; list.RemoveAt(list.Count - 1); return r; }
		public PriQ Peek() { return list[0]; }
		public PriQ Get(int n) { return list[n]; }
		public PriQ Last() { return list[list.Count - 1]; }
		public void Remove(int n) { list.RemoveAt(n); }
		public void Clear() { list.Clear(); }
		public int Count { get { return list.Count; } }

		private int Binary_Search(PriQ pq) {
			int Lower = 0;
			int Upper = list.Count - 1;
			while ( Lower <= Upper ) {
				int Center = ( Lower + Upper ) >> 1;
				if ( pq.rank > list[Center].rank ) {
					Lower = Center + 1;
				} else if ( pq.rank < list[Center].rank ) {
					Upper = Center - 1;
				} else {
					return Center;
				}
			}
			return Lower;
		}
	}


	//	文字列strをindex番目からdで上書き
	static string strOverWrite(string str, int i, string s) {
		return str.Remove(i, s.Length).Insert(i, s);
	}

	//　String[]  ----->  int[]
	static int[] parseAry(string[] str) {
		int[] nums = new int[str.Length];
		for ( int i = 0; i < str.Length; i++ ) { nums[i] = int.Parse(str[i]); }
		return nums;
	}
	//　String[]  ----->  long[]
	static long[] parseAryL(string[] str) {
		long[] nums = new long[str.Length];
		for ( int i = 0; i < str.Length; i++ ) { nums[i] = long.Parse(str[i]); }
		return nums;
	}

	//文字列を1文字ずつString[]に入れる
	static string[] strAry(String str) {
		string[] re = new string[str.Length];
		for ( int i = 0; i < str.Length; i++ ) { re[i] = str[i].ToString(); }
		return re;
	}


}

Measured memory_bytes: 22188