hdu 2124 Repair the Wall
来源:互联网 发布:sketch 软件 编辑:程序博客网 时间:2024/04/27 17:44
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2077 Accepted Submission(s): 1004
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<stdio.h>#include<algorithm>#include<iostream>using namespace std;bool cmp(int x,int y){ return (x>y);}int main (){ int n,m,a[1000]; int i; while(cin>>n>>m) { for(i=0;i<m;i++) cin>>a[i]; sort(a,a+m,cmp); int k=0; int sum=0; int flag=0; for(i=0;i<m;i++) { k++; sum+=a[i]; if(sum>=n) { flag=1; break; } } if(!flag) cout<<"impossible"<<endl; else cout<<k<<endl; }}
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
- jrebel + Eclipse + tomcat 实现热部署
- $(document).ready()与window.onload的区别
- 【翻译自mos文章】对于oracle 数据库来说,OGG的抽取进程什么时候到database中获取数据?
- Android PopupWindow
- poj1330( 树的先跟遍历)
- hdu 2124 Repair the Wall
- java编程思想是一本垃圾书
- ZTE/中兴X920 root教程_方法
- 使用 jQuery Mobile 与 HTML5 开发 Web App —— 07 jQuery Mobile 列表
- ThL A2 root教程_方法
- 欧达Shine4 root教程_方法
- 嵌入页面
- 富士通Arrows prototype root教程_方法
- 查找字符串之 BF算法