hdu_1.3.8_Crixalis's Equipment
来源:互联网 发布:mac怎么用u盘装双系统 编辑:程序博客网 时间:2024/05/17 08:27
Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1715 Accepted Submission(s): 705
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.
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
code:
#include<iostream>#include<algorithm>#include<cstdio>#include<stdlib.h>#include<stdio.h>#include<string.h>using namespace std;struct Node{ int ting; int shun; }; int cmp(Node x,Node y){ return x.ting+y.shun<y.ting+x.shun;}int main(){ int cas; cin>>cas; int v; int n; int flag; Node arg[100000]; while(cas--) { cin>>v; cin>>n; // memset(arg,0,sizeof(arg)); for(int i=0;i<n;i++) { cin>>arg[i].ting>>arg[i].shun; } sort(arg,arg+n,cmp); flag=1; for(int i=0;i<n;i++) { if(v>=arg[i].shun) { v-=arg[i].ting; } else { flag=0; break; } } if(flag==1) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}
- hdu_1.3.8_Crixalis's Equipment
- 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
- hdu_3177_Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- Crixalis's Equipment
- hdu3177 Crixalis's Equipment
- 黑马程序员—网络编程
- 序列
- [MDX学习笔记之一]MDX中一些常见的计算
- 蓝屏再见?科学家欲开发永不崩溃计算机(转载)
- 四年Java 一个java软件工程师的年终总结
- hdu_1.3.8_Crixalis's Equipment
- Hibernate关联关系配置(一对多、一对一和多对多)
- 正则表达式的用途语法与优先级(/应为\)
- hdu 3488
- 移植qt之交叉编译tslib-1.4
- Unity3D的Android移动之路之辅助工具及设备姿态
- 关于SetTexture()调用引起显存泄露的问题
- android:screenOrientation的说明
- iOS文档、视频等文件导入教程