using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;
using static AtCoder.Program;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            new ABC131().SolveD(new ConsoleInput(Console.In, ' '));
        }

        //ユークリッドの互助法 最大公約数
        public static long Gcd(long a, long b)
        {
            if (a < b)
                // 引数を入替えて自分を呼び出す
                return Gcd(b, a);
            while (b != 0)
            {
                var remainder = a % b;
                a = b;
                b = remainder;
            }
            return a;
        }

        // 最小公倍数
        public static long Lcm(long a, long b)
        {
            return a * b / Gcd(a, b);
        }

    }

    public class ConsoleInput
    {
        private readonly System.IO.TextReader _stream;
        private char _separator = ' ';
        private Queue<string> inputStream;
        public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
        {
            this._separator = separator;
            this._stream = stream;
            inputStream = new Queue<string>();
        }
        public string Read
        {
            get
            {
                if (inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split(_separator);
                for (int i = 0; i < tmp.Length; ++i)
                    inputStream.Enqueue(tmp[i]);
                return inputStream.Dequeue();
            }
        }
        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse(Read); } }
        public long ReadLong { get { return long.Parse(Read); } }
        public double ReadDouble { get { return double.Parse(Read); } }
        public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }

    }
  class ABC131
  {
  	public void SolveD(ConsoleInput cin)
        {
            var n = cin.ReadInt;
            var TuskList = new List<Tusk>();
            for (int i = 0; i < n; i++)
            {
                TuskList.Add(new Tusk(i, cin.ReadInt, cin.ReadInt));
            }
            var NewList = TuskList.OrderBy(x => x.DeadLine);
            int sumTime = 0;
            var canDo = true;
            foreach(Tusk tusk in NewList)
            {
                sumTime += tusk.Work;
                if(sumTime > tusk.DeadLine)
                {
                    canDo = false;
                    break;
                }
            }
            if (canDo) WriteLine("Yes");
            else WriteLine("No");
            ReadLine();
        }

        public class Tusk
        {
            public int No { get; set; }
            public int Work { get; set; }
            public int DeadLine { get; set; }
            public Tusk(int no, int work, int deadLine)
            {
                No = no;
                Work = work;
                DeadLine = deadLine;
            }
        }
  }
}

Measured memory_bytes: 30496