HDU3177 贪心
Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3957 Accepted Submission(s): 1625
Problem Description
![](http://acm.hdu.edu.cn/data/images/C241-1003-1.jpg)
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
2
20 3
10 20
3 10
1 7
10 2
1 10
2 11
Sample Output
Yes
No
Source
Recommend
lcy | We have carefully selected several similar problems for you: 1789 1051 1053 1045
代码:
1 /* 2 应该先放实际体积小而需要的体积大的,所以按照差值由大到小排序 3 */ 4 #include<iostream> 5 #include<string> 6 #include<cstdio> 7 #include<cmath> 8 #include<cstring> 9 #include<algorithm> 10 #include<vector> 11 #include<iomanip> 12 #include<queue> 13 #include<stack> 14 using namespace std; 15 int t,v,n; 16 struct eq 17 { 18 int a,b; 19 }e[1005]; 20 bool cmp(eq x,eq y) 21 { 22 return x.b-x.a>y.b-y.a; 23 } 24 int main() 25 { 26 scanf("%d",&t); 27 while(t--) 28 { 29 scanf("%d%d",&v,&n); 30 for(int i=0;i<n;i++) 31 { 32 scanf("%d%d",&e[i].a,&e[i].b); 33 } 34 sort(e,e+n,cmp); 35 for(int i=0;i<n;i++) 36 { 37 if(v<e[i].b) 38 { 39 v=-1; 40 break; 41 } 42 v-=e[i].a; 43 } 44 if(v==-1) 45 printf("No\n"); 46 else printf("Yes\n"); 47 } 48 return 0; 49 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步