HDU 3177 Crixalis's Equipment （贪心）

最新推荐文章于 2022-11-13 20:15:43 发布

BBHHTT

最新推荐文章于 2022-11-13 20:15:43 发布

阅读量325

点赞数

分类专栏：贪心算法

本文链接：https://blog.csdn.net/bbhhtt/article/details/81773309

版权

贪心算法专栏收录该内容

35 篇文章 2 订阅

订阅专栏

Crixalis's Equipment

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5122 Accepted Submission(s): 2089

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.

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.

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

题意：向体积为V的洞穴里存放n件装备，在移动装备需要B[i]空间，移动后V减少A[i]，问能不能放入所有装备

思路：按B[i]-A[i]排序

#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
	int a,b;
}num[10005];
int cmp(node x,node y)
{
	return x.b-x.a > y.b-y.a;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,v;
		int flag=0;
		scanf("%d%d",&v,&n);
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&num[i].a,&num[i].b);
		}
		sort(num,num+n,cmp);
		for(int i=0;i<n;i++)
		{
			if(num[i].b>v)
			{
				flag=1;
				break;
			}
			v-=num[i].a;
		}
		if(flag==1)
		{
			printf("No\n");
		}
		else printf("Yes\n");
	}
	return 0;
}