HDU Crixalis's Equipment

 

Crixalis's Equipment

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 399 Accepted Submission(s): 148

Problem Description Crixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, he keeps the living habit of a scorpion like living underground and digging holes. Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.

Input The first line contains an integer T, indicating the number of test cases. Then follows T cases, each one contains N + 1 lines. The first line contains 2 integers: V, volume of a hole and N, number of equipment respectively. The next N lines contain N pairs of integers: Ai and Bi. 0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.

Output For each case output "Yes" if Crixalis can move all his equipment into the new hole or else output "No".

Sample Input 2 20 3 10 20 3 10 1 7 10 2 1 10 2 11

Sample Output Yes No

Source HDU 2009-10 Programming Contest

Recommend lcy     分析：刚开始按照先b值降序排列再a值升序排列的方法做，结果错了几次，实在没想到怎么回事，后来百度了一下，才发现原来要按照差值的大小进行降序排列，差值相同的还要按照a值升序排列，后来想了一下，确实也是这样子，例如：v=12,n=2  然后是 10  11  1  10这组测试数据，肯定要先进1，然后再放10。代码好写，就不贴了哈~