import sys
import heapq

input = sys.stdin.buffer.readline


def solve(N, blocks):
    blocks.sort(key=lambda x: x[0] + x[1])
    S = sum(a for a, _ in blocks)
    h = []
    for _ in range(N):
        while blocks and blocks[-1][0] + blocks[-1][1] >= S:
            a, b = blocks.pop()
            heapq.heappush(h, -a)
        if h:
            a = -heapq.heappop(h)
            S -= a
        else:
            return False
    return True


N = int(input())
blocks = [tuple(map(int, input().split())) for _ in range(N)]
print("Yes" if solve(N, blocks) else "No")