n = int(input())
blocks = []
total = 0
for _ in range(n):
    a, b = map(int, input().split())
    blocks.append((a, b))
    total += a

# Sort by A_i + B_i in descending order
blocks.sort(key=lambda x: -(x[0] + x[1]))

sum_below = 0
possible = True
for a, b in blocks:
    required = total - (a + b)
    if sum_below < required:
        possible = False
        break
    sum_below += a

print("Yes" if possible else "No")