杭电2124 Repair the Wall
来源:互联网 发布:sem优化思路 编辑:程序博客网 时间:2024/04/27 15:22
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2082 Accepted Submission(s): 1009
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#include<stdio.h>#include<algorithm>using namespace std;bool cmp(__int64 a,__int64 b){return a>b;}int main(){ __int64 L,N; __int64 Sti[650]; while(scanf("%I64d%I64d",&L,&N)!=EOF) { __int64 sumL=0; for(int i=0;i<N;i++) { scanf("%I64d",&Sti[i]); sumL+=Sti[i]; } if(sumL<L) { printf("impossible\n"); continue; } sort(Sti,Sti+N,cmp); sumL=0; for(int i=0;i<N;i++) { sumL+=Sti[i]; if(sumL>=L) { printf("%d\n",i+1); break; } } }return 0;}
0 0
- 杭电 2124 Repair the Wall
- 杭电2124 Repair the Wall
- 杭电2124Repair the Wall
- 杭电-2124 Repair the Wall
- 【杭电2124】Repair the Wall
- 【杭电2124】Repair the Wall
- 【杭电 2124】Repair the Wall
- 【杭电】[2124]Repair the Wall
- 杭电acm2124 Repair the Wall
- 2124:Repair the Wall
- hdu 2124 Repair the Wall
- HDU 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- HDU 2124 Repair the Wall
- CCNA认证培训
- 测试以来的挣扎
- [有明信息]科目导向,精耕细作 ——浅谈房地产开发成本管理
- 算法导论第12章 二叉查找树中的后继
- POJ3630 - Phone List - 二叉树
- 杭电2124 Repair the Wall
- C# 实现多线程的同步方法
- 在Mac OS X中部署Tomcat的经验
- Android-- Intent.Action
- 学计算机的都是一群疯子!!!!
- spring中context:property-placeholder解析
- hdu 1431 素数回文
- opencv 2.x学习笔记(十四)离散傅里叶变换
- Excel表中如何将常规数字批量转换为以文本形式存储的数字?