题目1436：Repair the Wall

最新推荐文章于 2022-03-07 13:55:22 发布

dckong

最新推荐文章于 2022-03-07 13:55:22 发布

阅读量231

点赞数

分类专栏：九度贪心法文章标签：九度贪心法

本文链接：https://blog.csdn.net/dckong/article/details/51112789

版权

九度同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

贪心法

2 篇文章 0 订阅

订阅专栏

本文介绍了一种使用贪心算法解决修复墙壁裂缝问题的方法。Kitty需要利用不同大小的木块来填补长度为L的裂缝，目标是最少使用木块的数量完成修复。通过逆序选择最长的木块进行填充，直到裂缝被填满或无法继续填充。

摘要由CSDN通过智能技术生成

题目描述：

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 ?

输入：

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

输出：

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.

样例输入：

样例输出：

2
impossible

思路：

贪心法

  

#include<stdio h="">
#include<algorithm>
#include<iostream>
#include<string h="">
#include<math h="">
#include<memory h="">
using namespace std;
#define MAX_BLOCK_LENGTH 600
int main(){
	int crackLength, blockNum;

	while (scanf("%d%d", &crackLength, &blockNum) != EOF){
		int aBlockLength[MAX_BLOCK_LENGTH];
		memset(aBlockLength, 0, sizeof(aBlockLength));
		for (int i = 0; i < blockNum; i++){
			scanf("%d", &aBlockLength[i]);
		}
		sort(aBlockLength, aBlockLength + blockNum);
		int currentBlockNum = 0;
		int tmp = 0;
		for (int i = blockNum - 1; i >= 0; i--){
			tmp += aBlockLength[i];
			if (tmp >= crackLength){
				currentBlockNum++;
				break;
			}
		
			else{
				currentBlockNum++;
			}
		}
		if (tmp<crackLength){
			cout << "impossible" << endl;

		}
		else{
			cout << currentBlockNum << endl;
		}

	}
	return 0;
}

</memory></math></string></iostream></algorithm></stdio>