hdu1214 Repair the Wall

最新推荐文章于 2024-07-29 14:00:00 发布

原创最新推荐文章于 2024-07-29 14:00:00 发布 · 876 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#hdu1214 #Repair the Wall

贪心算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个算法问题，关于如何使用不同尺寸的木块最优化地填补墙面裂缝。裂缝大小为1×L，提供了N个尺寸为1×Ai的木块。目标是最少数量的木块完成修补工作。

//题目大意：有个矩形的裂缝长和宽是 1*L
//给了你N个块体，让你把裂缝补齐，每个快体长宽是Ai*1;
//问你需要多少个块体 
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[610];
int main(){
	int l, n;
	while(scanf("%d%d", &l, &n) != EOF){
		for(int i = 0; i < n; i++){
			scanf("%d", &a[i]);
		}
		int ans = 0;
		sort(a, a+n);
		for(int i = n-1; i >= 0; i--){
			if(a[i] <= l){
				l -= a[i];
				ans++;
			}else{
				if(l > 0){
					l = 0;
					ans++;
				}
				break;
			}
		}
		if(l == 0){
			printf("%d\n", ans);
		}else{
			printf("impossible\n");
		}
	}
	return 0;
}

Repair the Wall

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4738 Accepted Submission(s): 2311

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