杭电2124
来源:互联网 发布:js isnullorundefined 编辑:程序博客网 时间:2024/06/06 09:18
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3006 Accepted Submission(s): 1472
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
Author
linle
#include<iostream>#include<algorithm>using namespace std;bool cmp(int a,int b){return a>b;}int main(){int l,n,size[601],i,s;int k;while(scanf("%d%d",&l,&n)!=EOF){for(i=0;i<n;i++)cin>>size[i];sort(size,size+n,cmp);k=0;s=0;for(i=0;i<n;i++){if(size[i]<=l){s=s+size[i];k++;if(s>=l){cout<<k<<endl;break;}}else{cout<<"1"<<endl;break;}}if(i==n&&s<l)cout<<"impossible"<<endl;}return 0;}
0 0
- 杭电2124
- 杭电
- 杭电
- 杭电
- 杭电 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
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 压缩感知理论+一个经典的算法
- 链表
- 自定义progressbar
- UbuntuSkills
- 简单DMA介绍
- 杭电2124
- 做数字图像处理必备的 图库
- 经典:传统相机标定方法解析…
- RANSAC算法
- CvPoint及CvPoint2D32f
- xx.^2
- CentOS设置默认启动命令行(…
- 排序算法
- U盘安装 CentOS 7