hdoj problem 3177 Crixalis's Equipment(贪心题)
来源:互联网 发布:京华科讯软件 编辑:程序博客网 时间:2024/06/09 18:40
Crixalis's Equipment
http://acm.hdu.edu.cn/showproblem.php?pid=3177
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3105 Accepted Submission(s): 1259
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 | We have carefully selected several similar problems for you: 1051 1053 1045 1050 1055
/*
先对Ai,Bi进行处理,在进行排序,再按照贪心的思想逐步贪心解决!
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
int ai;
int bi;
int c;
}sc[1010];
int cmp(node x,node y)
{
return x.c>y.c;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int i,v,n;
scanf("%d%d",&v,&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&sc[i].ai,&sc[i].bi);
sc[i].c=sc[i].bi-sc[i].ai;
}
sort(sc,sc+n,cmp);
int flag=0;
for(i=0;i<n;i++)
{
if(v>=sc[i].bi)//贪心思想的集中体现
v-=sc[i].ai;
else
{
flag=1;
break;
}
}
if(flag)
printf("No\n");
else
printf("Yes\n");
}
return 0;
}
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
int ai;
int bi;
int c;
}sc[1010];
int cmp(node x,node y)
{
return x.c>y.c;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int i,v,n;
scanf("%d%d",&v,&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&sc[i].ai,&sc[i].bi);
sc[i].c=sc[i].bi-sc[i].ai;
}
sort(sc,sc+n,cmp);
int flag=0;
for(i=0;i<n;i++)
{
if(v>=sc[i].bi)//贪心思想的集中体现
v-=sc[i].ai;
else
{
flag=1;
break;
}
}
if(flag)
printf("No\n");
else
printf("Yes\n");
}
return 0;
}
0 0
- hdoj problem 3177 Crixalis's Equipment(贪心题)
- 【贪心】 HDOJ 3177 Crixalis's Equipment
- hdoj 3177 Crixalis's Equipment 【贪心】
- HDOJ-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 贪心
- hdu 3177 Crixalis's Equipment (贪心)
- HDU 3177 Crixalis's Equipment(贪心)
- HDU 3177 Crixalis's Equipment 贪心
- HDU.3177Crixalis's Equipment(贪心)
- hdu3177 Crixalis's Equipment (贪心)
- HDU Crixalis's Equipment (贪心)
- 3177Crixalis's Equipment
- HDU 3177 Crixalis's Equipment(贪心算法)
- hdu 3177 Crixalis's Equipment (贪心- - 排序)
- 《读书笔记》设计模式——装饰模式
- 存储管理-分区分配与回收算法(Java简单实现)
- HDU 5124 树状数组+map操作
- char、varchar、nchar、nvarchar的区别
- Java面试题--基础知识部分
- hdoj problem 3177 Crixalis's Equipment(贪心题)
- PhpMyAdmin漏洞利用总结with Metasploit
- 利用后台SQL查询语句拿webshell
- hdoj problem 5037 Frog(贪心)
- 图形
- 巧用“Delegate”实现AOP事务
- Google I/O 2014 最新技术分析
- 基于CC2530的SPI通信调试笔记
- 执行make menuconfig出现“Unable to findthe ncurses libraries”的解决方法