hdu1214 Repair the Wall
来源:互联网 发布:python 循环定时器 编辑:程序博客网 时间:2024/05/19 20:44
//题目大意:有个矩形的裂缝长和宽是 1*L//给了你N个块体,让你把裂缝补齐,每个快体长宽是Ai*1;//问你需要多少个块体 #include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int a[610];int main(){int l, n;while(scanf("%d%d", &l, &n) != EOF){for(int i = 0; i < n; i++){scanf("%d", &a[i]);}int ans = 0;sort(a, a+n);for(int i = n-1; i >= 0; i--){if(a[i] <= l){l -= a[i];ans++;}else{if(l > 0){l = 0;ans++;}break;}}if(l == 0){printf("%d\n", ans);}else{printf("impossible\n");}}return 0;}
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4738 Accepted Submission(s): 2311
Problem 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 ?
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<L<1000000000) and N(0<=N<600) which
mentioned above.
In the second line, there are N positive integers. The ith integer Ai(0<Ai<1000000000 ) means that the ith block has the size of 1×Ai (in inch).
Each test case contains two lines.
In the first line, there are two integers L(0<L<1000000000) and N(0<=N<600) which
mentioned above.
In the second line, there are N positive integers. The ith integer Ai(0<Ai<1000000000 ) means that the ith block has the size of 1×Ai (in inch).
Output
For each test case , print an integer which represents the minimal number of blocks are needed.
If Kitty could not repair the wall, just print "impossible" instead.
If Kitty could not repair the wall, just print "impossible" instead.
Sample Input
5 33 2 15 22 1
Sample Output
2impossible
阅读全文
0 0
- hdu1214 Repair the Wall
- hdu2124 Repair the Wall
- Repair the Wall+贪心
- Repair the Wall
- 2124:Repair the Wall
- Repair the Wall
- Repair the Wall
- Repair the Wall
- Repair the Wall
- Repair the wall
- Repair the Wall
- Repair the Wall
- hdu 2124 Repair the Wall
- 题目24:Repair the Wall
- 题目24:Repair the Wall
- HDU 2124 Repair the Wall
- 题目1436:Repair the Wall
- hdu2124 Repair the Wall (贪心)
- POJ
- 词汇暴增总结
- 为何Java 类不支持多继承?
- 【php中的curl】php中curl的详细解说
- 数据存储——HashMap,Hashtable的区别
- hdu1214 Repair the Wall
- jctf2014RE200
- 图像处理基础(4):高斯滤波器详解
- 最小k个数之和
- D
- uva-11806 容斥
- S3C2440上LCD驱动(FrameBuffer)实例开发讲解(一)
- Linux-1
- keepalived+lvs