/* imports all std modules {{{*/
import
  std.algorithm,
  std.array,
  std.ascii,
  std.base64,
  std.bigint,
  std.bitmanip,
  std.compiler,
  std.complex,
  std.concurrency,
  std.container,
  std.conv,
  std.csv,
  std.datetime,
  std.demangle,
  std.encoding,
  std.exception,
  std.file,
  std.format,
  std.functional,
  std.getopt,
  std.json,
  std.math,
  std.mathspecial,
  std.meta,
  std.mmfile,
  std.net.curl,
  std.net.isemail,
  std.numeric,
  std.parallelism,
  std.path,
  std.process,
  std.random,
  std.range,
  std.regex,
  std.signals,
  std.socket,
  std.stdint,
  std.stdio,
  std.string,
  std.system,
  std.traits,
  std.typecons,
  std.uni,
  std.uri,
  std.utf,
  std.uuid,
  std.variant,
  std.zip,
  std.zlib;
/*}}}*/

/+---test
5
2 4
1 9
1 8
4 9
3 12
---+/
/+---test
3
334 1000
334 1000
334 1000
---+/
/+---test
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
---+/

void main(string[] args) {
  const N = readln.chomp.to!long;

  long[][long] jobs;
  foreach (i; 0..N) {
    long a, b;
    readf(" %d %d ", &a, &b);
    jobs[b] ~= a;
  }

  auto limits = jobs.keys.array.sort!"a < b";

  long t;
  foreach (limit; limits) {
    t += jobs[limit].sum;
    if (t > limit) {
      "No".writeln;
      return;
    }
  }
  "Yes".writeln;
}
