## https://yukicoder.me/problems/no/1570

import heapq

def main():
    N = int(input())
    ab = []
    for _ in range(N):
        a, b = map(int, input().split())
        ab.append((a, b))

    ab_array = []
    for a, b in ab:
        ab_array.append((a + b, a))
    ab_array.sort(key=lambda x: x[0])
    sum_a = 0
    for a, _ in ab:
        sum_a += a

    queue = []
    index = N - 1
    while sum_a > 0:
        while index >= 0 and ab_array[index][0] >= sum_a:
            heapq.heappush(queue, -ab_array[index][1])
            index -= 1

        if len(queue) == 0:
            print("No")
            return
        
        x = heapq.heappop(queue)
        sum_a += x
    
    print("Yes")


    



if __name__ == "__main__":
    main()