Repair the Wall
来源:互联网 发布:新点计价软件 编辑:程序博客网 时间:2024/05/29 13:21
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;__int64 a[10001];int main(){__int64 l,n;while(scanf("%I64d%I64d",&l,&n)!=EOF){for(int i=0;i<n;i++){scanf("%I64d",&a[i]); } sort(a,a+n); __int64 cut=1,sum=0; int f=0; for(int i=n-1;i>=0;i--) { if(sum+a[i]<l) { sum+=a[i]; cut++; } else { f=1; break; } } if(f==1) { printf("%I64d\n",cut); } else { 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 (贪心)
- 实验项目3-6:表达式转换(中缀表达式转后缀表达式)
- 51NOD 1060 最复杂的数
- Gym 100803A(贪心)
- 单链表
- PHP语言建立数据库和数据表(完整版)
- Repair the Wall
- hdu 5742 简单贪心
- C++中内存(堆和栈)
- tomcat启动的内存溢出解决
- 九度1032
- Caused by: java.sql.BatchUpdateException: ORA-01438: 值大于为此列指定的允许精度如何解决
- HDU1878 欧拉回路
- ajax基本知识
- Codeforces 464A No to Palindromes!