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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Control.Concurrent
import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.Char

--import qualified Data.Heap as H  -- atcoder judge does not have this.
import Data.List

import qualified Data.Set as S

solver3 :: [(Int, Int)] -> String
solver3 ls =
  let ordered = reverse $ sortOn snd ls
   in let latest_dead = snd $ head ordered
       in eater latest_dead ordered
  where
    eater t [] =
      if t < 0
        then "No"
        else "Yes"
    eater t ((len, dead):rest) = (eater $! (t - len)) rest

solver4 :: [(Int, Int)] -> String
solver4 ls =
  let idxed = [(dl, len, i) | ((len, dl), i) <- zip ls [1 ..]]
   in let set = S.fromList idxed
       in let (dl, _, _) = S.findMax set
           in eater dl set
  where
    eater t s =
      if s == S.empty
        then if t < 0
               then "No"
               else "Yes"
        else let Just ((_, len, _), rest) = S.maxView s
              in eater (t - len) rest

solver5 :: [(Int, Int)] -> String
solver5 ls =
  let ordered = reverse $ sortOn snd ls
   in let latest_dead = snd $ head ordered
       in eater latest_dead ordered
  where
    eater t [] = "Yes"
    eater t ((len, dead):rest) =
      if t - len < 0
        then "No"
        else (eater $! (t - len)) rest

solver6 :: [(Int, Int)] -> String
solver6 ls =
  let ordered = sortOn snd ls
   in eater 0 ordered
  where
    eater t [] = "Yes"
    eater t ((len, dead):rest) =
      if (t + len > dead)
        then "No"
        else eater (t + len) rest

main :: IO ()
main = do
  n <- read <$> getLine
  dat <-
    replicateM
      n
      ((\(a:b:_) -> (a, b)) . unfoldr (BS.readInt . BS.dropWhile isSpace) <$>
       BS.getLine)
  --dat <-
  --  replicateM n (\(a:b:_) -> (a, b)) . map (read . BS.unpack) . BS.words <$> BS.getLine
  mv <- newEmptyMVar
  --forkIO $ worker6 (reverse dat) mv
  forkIO $ worker6 dat mv
  --forkIO $ worker5 (reverse dat) mv
  --forkIO $ worker5 dat mv
  ans <- takeMVar mv
  putStrLn ans
  --putStrLn $ solver6 dat

worker6 :: [(Int, Int)] -> MVar String -> IO ()
worker6 dat mv =
  let ans = (solver6 dat)
   in seq ans (putMVar mv ans)

worker5 :: [(Int, Int)] -> MVar String -> IO ()
worker5 dat mv =
  let ans = (solver5 dat)
   in seq ans (putMVar mv ans)