杭电 3177 Crixalis's Equipment
来源:互联网 发布:淘宝首页大图代码 编辑:程序博客网 时间:2024/06/06 12:46
http://acm.hdu.edu.cn/showproblem.php?pid=3177
Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2562 Accepted Submission(s): 1056
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
<span style="font-size:18px;">#include<iostream> #include<cstdio> #include<algorithm> using namespace std;struct Node{ int a,b; int c;}s[1005];bool cmp(Node a,Node b){ return a.c>b.c;}int main(){ int T,V,N,i; scanf("%d",&T); while(T--) { scanf("%d%d",&V,&N); for(i=0;i<N;i++) { scanf("%d%d",&s[i].a,&s[i].b); s[i].c=s[i].b-s[i].a; } sort(s,s+N,cmp); for(i=0;i<N;i++) { if(s[i].b>V) { printf("No\n"); break; } else V=V-s[i].a; } if(i==N) printf("Yes\n"); } return 0;}</span>
0 0
- 杭电 3177 Crixalis's Equipment
- 3177Crixalis's Equipment
- 杭电ACM3117——Crixalis's Equipment
- hdu 3177 - Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- HDU-3177 Crixalis's Equipment
- HDU - 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment 贪心
- hdu 3177 Crixalis's Equipment(贪心)
- hdu 3177Crixalis's Equipment(贪心)
- HDU 3177 Crixalis's Equipment 贪心
- HDUJ 3177 Crixalis's Equipment 贪心
- gcc 中typeof的用法
- HDUJ 2040 亲和数
- 浅谈CSRF攻击方式
- Linux 兴趣小组暑假学习--学习总结<一>
- #include<string>与#include<string.h>的区别
- 杭电 3177 Crixalis's Equipment
- 在Ubuntu系统上进行SAE+Python+Django开发记录—1.环境搭建
- Android Application
- 定时ajax抓取数据
- 【并查集】 不相交集合 - 并查集 教程(文章作者:Slyar)
- 详解Spring中的CharacterEncodingFilter--forceEncoding为true在java代码中设置失效--html设置编码无效?不知真假
- SVD解线性方程组——秘密大起底
- String、StringBuffer与StringBuilder之间区别
- A*算法