Repair the Wall(贪心 区间覆盖)
来源:互联网 发布:开淘宝店铺的步骤 编辑:程序博客网 时间:2024/04/27 14:16
Repair the Wall
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.
When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty’s walls were made of wood.
One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repaired perfectly, without any gap.
Now, Kitty knew the size of each blocks, and wanted to use as fewer as possible of the blocks to repair the wall, could you help her ?
Input
The problem contains many test cases, please process to the end of file( EOF ).
Each test case contains two lines.
In the first line, there are two integers L(0
#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<math.h>#include<queue>using namespace std;const int maxn=605;int main(){ int L,N; while(scanf("%d%d",&L,&N)!=EOF) { int num[maxn]; for(int i=0;i<N;i++) scanf("%d",&num[i]); sort(num,num+N); int result=0; for(int i=N-1;i>=0&&L>0;i--) { L-=num[i]; result++; } L>0?printf("impossible\n"):printf("%d\n",result); } return 0;}
- Repair the Wall(贪心 区间覆盖)
- Repair the Wall(贪心)
- Repair the Wall+贪心
- HDU Repair the Wall (贪心)
- HDU 2124 Repair the Wall (贪心)
- HDU 2124Repair the Wall(贪心)
- HDU 2124 Repair the Wall(贪心)
- hdu2124 Repair the Wall (贪心)
- HDU2124 Repair the Wall 【贪心】
- HDU2124 Repair the Wall(贪心)
- HDU2124——Repair the Wall(贪心水题)
- 【HDU-oj】-2124-Repair the Wall(贪心)
- HDOJ 2124 Repair the Wall(修城墙,贪心)
- hdoj 1010 Repair the Wall(贪心)
- hdu 2124 Repair the Wall 贪心
- hdoj 2124 Repair the Wall 【贪心】
- hdu2124--Repair the Wall(贪心水题)
- HDUOJ贪心算法Repair the wall
- 【iOS开发】网络请求报错
- Polya计数
- 漫步校园
- DateEdit 只显示年月 devexpress 16
- UVA 12299 RMQ with Shifts 线段树
- Repair the Wall(贪心 区间覆盖)
- notepad颜色相关修改
- 【BS学习】——B/S结构
- 注解的应用
- 260. Single Number III
- Android之使用TCP和URL协议进行网络编程
- JsonKit的基本使用
- Native与H5交互的那些事
- 用Ghost搭建自己的博客