Repair the Wall
来源:互联网 发布:淘宝大马士革刀真假 编辑:程序博客网 时间:2024/05/19 23:15
问题 D: Repair the Wall
时间限制: 1 Sec 内存限制: 32 MB题目描述
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.
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 ?
输入
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).
输出
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.
样例输入
2 2
12 11
14 3
27 11 4
109 5
38 15 6 21 32
5 3
1 1 1
样例输出
1
1
5
impossible
#include<stdio.h>#include<algorithm>using namespace std;bool cmp(int a,int b){ return a>b;}int main(){ int l,n; while(scanf("%d%d",&l,&n)!=EOF) { int an[605]={0},sum=0,num=0; for(int i=0;i<n;i++) { scanf("%d",&an[i]); sum+=an[i]; } if(sum<l) { printf("impossible\n"); continue; } if(sum==l) { printf("%d\n",n); continue; } sum=0; sort(an,an+n,cmp); for(int i=0;i<n;i++) { sum+=an[i]; if(sum>=l) { printf("%d\n",i+1); break; } } } return 0;}
阅读全文
0 0
- 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
- hdu1214 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 (贪心)
- hdu6103 Krinriki(尺取法)
- Tensorflow实战之用softmax Regression识别手写数字
- 关于全栈
- android APK更新原理以及代码实现
- (十五)RpcContext对象
- Repair the Wall
- markdown help
- POJ-2342 Anniversary party(没有上司的晚会) 树状动归
- phpStorm快捷键
- 输入边框&原型设计
- sqlite3_prepare_v2返回26错误码的解决
- 后端往前段传递参数,大部分人都清楚,无非就是发起ajax请求获取后端值,然后通过js写入html相应位置即可。但是前段html页面之间,怎么传递参数呢?
- 配置openresty使用lua并发请求API
- 自费出书出版流程