Repair the Wall
来源:互联网 发布:中日关系现状 知乎 编辑:程序博客网 时间:2024/05/29 13:23
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 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
2impossible
#include<cstdio>
#include<algorithm>using namespace std;
bool cmp(int a,int b)
{
return a > b;
}
int main()
{
int l,n,i,j;
int block[700];
while(~scanf("%d %d",&l,&n))
{
for(i=0;i<n;i++)
scanf("%d",&block[i]);
sort(block,block+n,cmp);
int num=0,k=0,j=0;
for(i=0;i<n;i++)
{
if(block[i]+k<l)
{
num++;
k+=block[i];
}
else
{
num++;
j=1;
printf("%d\n",num);
break;
}
}
if(j==0)
printf("impossible\n");
}
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 (贪心)
- 虚幻4 SCOPE_CYCLE_COUNTER
- 嵌入式学习-驱动开发前奏-lesson3-linux内核链表
- linux(三)-command(operate,network,authentication,resource)
- ngui uiroot 自适应问题
- Android基础知识---ContentProvider的基础知识
- Repair the Wall
- 这是一堆 wrong 懵逼的题目
- 安卓学习笔记---解决在在Edittext输入的时候,输入框被软键盘遮挡部分内容的问题(二)
- C源程序完整编译过程
- 趣拍SDK的使用其他颜色渲染,和第二次录制的时候会崩溃问题
- linux 的文件权限
- 错误:javax.servlet.jsp.PageContext can not be to a type
- Java 回调简单Demo
- VMware 12.1.1 长模式不兼容/中断导致虚拟CPU进入关机或重启