Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5017 Accepted Submission(s): 2042
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
220 310 203 101 710 21 102 11
Sample Output
YesNo
Source
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
int a,b;
};
bool cmp(node a,node b)
{
return a.b-a.a>b.b-b.a;//尽量先排实际体积小,虚拟体积大的东西
}
int main()
{
int N;
scanf("%d",&N);
while(N--)
{
int m,n,i;
scanf("%d%d",&m,&n);
node as[n];
for(i=0;i<n;i++)
scanf("%d%d",&as[i].a,&as[i].b);
sort(as,as+n,cmp);
for(i=0;i<n;i++)
{
if(m>=as[i].b)//注意应该这里是大于等于号
m-=as[i].a;
else
break;
}
if(i==n)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}