【杭电2124】Repair the Wall
来源:互联网 发布:js防水涂料使用年限 编辑:程序博客网 时间:2024/04/27 15:29
Repair the Wall
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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 i th integer Ai(0<Ai<1000000000 ) means that the i th 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 i th integer Ai(0<Ai<1000000000 ) means that the i th 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
2impossible1234567891011121314151617181920212223242526272829303132333435363738394041#include<stdio.h>#include<algorithm>using namespace std;bool cmp(int a,int b){return a>b;}int main(){int l,n,a[610];while(scanf("%d%d",&l,&n)!=EOF){int s=0;for(int i=0;i<n;i++){scanf("%d",&a[i]);s=s+a[i];}if(s<l)printf("impossible\n");else {sort(a,a+n,cmp); int sum=0; for(int i=0;i<n;i++) { if(l<=a[i]) { sum=sum+1; break; } else { sum=sum+1; l=l-a[i]; } } printf("%d\n",sum); } }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
- 1. Two Sum
- JQuery事件绑定
- 杭电5742 之 It's All In The Mind
- 出现次数最多的整数-蓝桥杯算法训练
- Python cx_Oracle 5.0 新特性概述
- 【杭电2124】Repair the Wall
- 内容过滤选择器
- Java邻接表表示加权有向图,附dijkstra最短路径算法
- 为什么会使用-ObjC在Xcode应用中
- centos6.5 SVN搭建创建版本库 svnadmin create /home/svn/svnfile
- 产品经理——关于产品的销售
- web flash 视频播放器代码开源
- 基本过滤选择器
- 解决v7报中没有CardView的方法