Crixalis's Equipment
来源:互联网 发布:如何制作云免流软件 编辑:程序博客网 时间:2024/05/16 12:23
Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3097 Accepted Submission(s): 922Problem 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.
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.
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
220 310 203 101 710 21 102 11
Sample Output
YesNo
Source
HDU 2009-10 Programming Contest
Recommend
lcy
分析参考:http://www.cnblogs.com/Action-/archive/2012/07/03/2575069.html
#include<stdio.h>#include<stdlib.h>struct Equipment{ int ai; int bi;}ep[1000];int comp(const void *a,const void *b){ struct Equipment *c=(struct Equipment *)a;//类型转换 struct Equipment *d=(struct Equipment *)b; return (c->ai+d->bi) - (c->bi+d->ai);//不能用大于号代替减号,否则不能AC}int main(){ int num=0; int V=0,N=0; int i=0; int flag=0;//能否成功的标志。1为Yes scanf("%d",&num); while(num--) { flag=1; scanf("%d%d",&V,&N); for(i=0;i<N;i++) { scanf("%d%d",&ep[i].ai,&ep[i].bi); } qsort(ep,N,sizeof(struct Equipment),comp); for(i=0;i<N;i++) { if(ep[i].bi>V) { flag=0; break; } V-=ep[i].ai; } if(flag==0) printf("No\n"); else printf("Yes\n"); } return 0;}
0 0
- HDOJ-Crixalis's Equipment
- HDU Crixalis's Equipment
- HDU Crixalis's Equipment
- HDU3177-Crixalis's Equipment
- HDU Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- hdu Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- hdu3177 Crixalis's Equipment
- 3177Crixalis's Equipment
- hdu 3177 - Crixalis's Equipment
- date0406/InterfaceDemo.java
- date0406/InterfaceTest.java
- 判断一个单向链表中是否存在环
- 文件读入读出方式
- date0406/TemplateDemo.java
- Crixalis's Equipment
- android 小知识
- 乒乓球
- 3.9 Strategy(策略) -- 对象行为型模式
- 【Xcode使用技巧】Xcode调试方法
- (534A)codeforce
- 反转链表
- 3.10 Template Method(模板方法) -- 类行为型模式
- date0407/ObjectEquals.java