HDU - 2124 Repair The Wall （贪心水题）

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 ? 

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

题目大概意思是墙上有一个长为L宽为1的矩形裂缝，给你n块宽为1长度分别为a1……an的木板，求至少需要多少块木板才能把墙修好（木板可以切割）

思路：

这题就是一个简单的贪心，只需要将所给木板长度进行从大到小排序后累加，累加结果如果大于裂缝长度则直接跳出循环（最后要注意如果用完所给木板还不能达到长度L则输出inpossible）

代码

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

bool compare(long long a,long long b){
	return a > b;
}

long long l,n,arr[700];

int main(){
    while(scanf("%lld %lld",&l,&n) != EOF){
        long long ans = 0,tmp = 0;

        for(int i = 0;i < n;i++)
            scanf("%lld",&arr[i]);

        sort(arr,arr + n,compare);

        for(int i = 0;i < n;i++){
            tmp += arr[i];
            if(tmp >= l){
                ans = i + 1;
                break;
            }
        }

        if(ans > 0 && ans <= n)
            cout << ans << endl;
        else
            cout << "impossible" << endl;
    }
    return 0;
}