import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
long bignum = 1_000_000_007;
alias Works = Tuple!(long, "require", long, "limit");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    auto n = lread();
    auto w = new Works[](n);
    foreach (i; 0 .. n)
    {
        long a, b;
        scan(a, b);
        w[i] = Works(a, b);
    }
    w.sort!"a.limit < b.limit"();
    long timesum;
    bool check = true;
    foreach (e; w)
    {
        timesum += e.require;
        if(timesum > e.limit)
            check = false;
    }
    if(check)
        writeln("Yes");
    else
        writeln("No");
}
