import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
#10**20に変えるのもあり
MOD = 10**9 + 7
MOD2 = 998244353
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    Block = [0]*N
    Asum = 0
    for n in range(N):
        A,B = MI()
        Block[n] = (A,B)
        Asum += A
    from operator import itemgetter
    Bs = sorted(Block, key = itemgetter(1,0),reverse=True)
    Acum = 0
    #print(Bs)
    I = 0
    from heapq import heappop, heappush
    H = []
    for n in range(N):
        while(I<N):
            a, b = Bs[I]
            if(Asum-(Acum+a) <= b):
                I+=1
                heappush(H,-a)
            else:
                break
        #print(H)
        if not H :
            print("No")
            exit()
        else:
            Acum += -heappop(H)
    print("Yes")
    return
solve()