hdoj2124Repair the Wall(贪心)

最新推荐文章于 2020-06-15 21:42:44 发布

原创最新推荐文章于 2020-06-15 21:42:44 发布 · 307 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

贪心

本文描述了一个算法问题，即如何使用最少数量的木块来填补长度为L的裂缝。输入包含多个测试用例，每个用例给出裂缝长度及不同尺寸的木块，目标是最优地分配这些木块以完全覆盖裂缝。

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<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.

Sample Input

Sample Output

2
impossible

Author

linle

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1100];
bool cmp(int a,int b)
{
	return a>b;
}
int main()
{
	int l,n;
	int i;
	while(scanf("%d%d",&l,&n)!=EOF)
	{
		for(i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		int ans=0;
		sort(a,a+n,cmp);
		for(i=0;i<n;i++)
		{
			if(a[i]<l)
			{
				ans++;
				l-=a[i];
			}
			else
			{
				ans++;
				l-=a[i];
				if(l<=0)
				break;
			}
		}
		if(l>0)
		printf("impossible\n");
		else
		printf("%d\n",ans);
	}
	return 0;
}