HDU-3177 Crixalis's Equipment

Crixalis's Equipment

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1481    Accepted Submission(s): 607

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

 1 /*

 2 题目大意：向一个容量为V的洞中搬物品 每件物品有一个停放体积 可一个移动体积 问能否放下这些物品

 3 

 4 解题思路：对这些物品进行排序 按照顺序依次进入洞中 排序要尽可能使得所有的东西都能进入洞中

 5 

 6 这是一个贪心的问题  

 7 

 8                                    停放体积         移动体积

 9 

10 

11                   第一件物品          a1             b1

12 

13                  

14 

15                   第二件物品          a2             b2

16 

17 

18 假设这两件物品的移动体积都不大于洞的体积V

19 

20 那么将单独比较两个物品的时候会发现  a1+b2为先放第一件物品 后放第二件物品的最大瞬时体积

21 

22                                                   a2+b1为先放第二件物品 后放第一件物品的最大瞬时体积

23 

24 我们应该选择a1+b2和a2+b1中比较小的先放

25 

26 那么从2件物品 扩展到N件物品 假设n件物品的移动体积都不大于洞的体积V(如果有大于的 那么结果必然是NO)    

27 

28 将N件物品按照a1+b2<a2+b1进行排序 然后依次放入洞中    

29 */

30 

31 #include<cstdio> 

32 #include<algorithm> 

33 using namespace std; 

34 struct Node 

35 { 

36     int ai,bi; 

37 }a[1001]; 

38 bool cmp(Node x,Node y) 

39 { 

40     return x.ai+y.bi<y.ai+x.bi;

41 }

42 

43 int main() 

44 { 

45     int t,i,j; 

46     scanf("%d",&t);

47     for(i=1;i<=t;i++) 

48     { 

49         int v,n; 

50         scanf("%d%d",&v,&n); 

51         for(j=1;j<=n;j++) 

52             scanf("%d%d",&a[j].ai,&a[j].bi);

53         sort(a+1,a+n+1,cmp); 

54         int k=0; 

55         for(j=1;j<=n;j++) 

56         { 

57             if(a[j].bi>v) 

58             { 

59                 printf("No\n");

60                 k=1;

61                 break; 

62             } 

63             else

64                 v-=a[j].ai; 

65         } 

66         if(!k) 

67         printf("Yes\n");

68     } 

69     return 0; 

70 }