Problem:
Score: 400 points

Problem Statement

Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.

Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.

It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.

Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.

Can Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)

Input

Input is given from Standard Input in the following format:

N
A_1 B_1
.
.
.
A_N B_N

Output

If Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.

Sample Input 1

5
2 4
1 9
1 8
4 9
3 12

Sample Output 1

Yes

He can complete all the jobs in time by, for example, doing them in the following order:

Do Job 2 from time 0 to 1.

Do Job 1 from time 1 to 3.

Do Job 4 from time 3 to 7.

Do Job 3 from time 7 to 8.

Do Job 5 from time 8 to 11.

Note that it is fine to complete Job 3 exactly at the deadline, time 8.

Sample Input 2

3
334 1000
334 1000
334 1000

Sample Output 2

No

He cannot complete all the jobs in time, no matter what order he does them in.

Sample Input 3

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

Sample Output 3

Yes

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
#define lop(i,a,b) for(register int i = (a); i <= (b); ++i)
#define dlop(i,a,b) for(register int i = (a); i >= (b); --i)
#define bl(i) for(int i = head[u]; i; i = G[i].next)
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)>(b)?(b):(a))
#define rint register int
#define abs(a) ((a)>0?(a):(-(a)))
#define eps (1e-7)
#define MP make_pair
typedef pair<int, int> pii;
inline int read() {
  register int c = getchar(), x = 0, f = 1;
  while (!isdigit(c)) {if (c == '-') f = -1; c = getchar();}
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 200005;
int n;
priority_queue <pii> q;
int dead, cost, cnt;
struct build {
  int t1, t2;
  inline bool operator < (const build &rhs) const {
    return t2 == rhs.t2 ? t1 < rhs.t1 : t2 < rhs.t2;
  }
} b[N];
int main(void) {
  n = read();
  lop(i, 1, n) b[i].t1 = read(), b[i].t2 = read();
  sort(b + 1, b + 1 + n);
  puts("GG");
  return 0;
  lop(i, 1, n) {
    cost += b[i].t1, dead = b[i].t2;
    if (cost <= dead) q.push(MP(b[i].t1, b[i].t2));
    else {//cost > dead
      pii x = q.top();
      if (cost - x.first <= dead && x.first > b[i].t1) {
        q.pop();
        q.push(MP(b[i].t1, b[i].t2));
        cost -= x.first;
      }
      else cost -= b[i].t1;
    }
  }
  puts((q.size() == (unsigned int)n) ? "Yes" : "No");
  return 0;
}