hdu 2124 Repair the Wall
来源:互联网 发布:淘宝网商城家电 编辑:程序博客网 时间:2024/04/27 15:17
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2084 Accepted Submission(s): 1011
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<cstdio>#include<algorithm>using namespace std;int cmp(int a,int b){ return a>b;}int main(){ int l,n,a[1010],i,j,sum,ok; while(scanf("%d %d",&l,&n)!=EOF) { for(i=0; i<n; i++) scanf("%d",&a[i]); sort(a,a+n,cmp); for(i=0,sum=0,ok=0; i<n; i++) { sum+=a[i]; if(sum>=l) { ok=1; break; } } if(ok) printf("%d\n",i+1); else printf("impossible\n"); } return 0;}
0 0
- 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
- 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 2124Repair the Wall
- hdu 2124 Repair the Wall
- HDU 2124 Repair the Wall
- HDU 2124 Repair the Wall
- 查看cpu个数
- 网址导航如何在阵痛中寻找发展良机
- Manacher求最长回文
- 小米MIUI 6开启内测:首批适配小米4和小米3
- NSDictionary && NSMutableDictionary && NSSet
- hdu 2124 Repair the Wall
- (待切,标记上)暑期个人赛--第七场--E
- CPU绑定技术
- C++中的explicit关键字
- 在windows下如何更新vundle?
- hdu 2391 Filthy Rich
- linux下安装java
- uva 1561 - Cycle Game(推理)
- linux多线程(1)