|
?
?
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2076 Accepted Submission(s): 1003
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 ?
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
mentioned above.
In the second line, there are N positive integers. The i
th integer Ai(0
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.
Sample Input
5 3
3 2 1
5 2
2 1 Sample Output
2
impossible
题目大意：有块墙破了，需要修补，破坏的地方是一个宽为1矩形，长度为L，有n块矩形木板（宽为1）长为A[i]。木板可以切割，求最少需要多少块木板。
AC代码：
#include
#include
#include
#include
using namespace std; __int64 a[605]; bool cmp(__int64 a,__int64 b) { return a>b; } int main() { __int64 l,n,i,sum,tot; while(~scanf(%I64d%I64d,&l,&n)) { for(i=0; i
=a[i]) { sum++; l=l-a[i]; } else { if(l)//切割~ sum++; break; } } } printf(%I64d ,sum); } return 0; }
?
|