【AC】九度OJ题目1436：Repair the Wall

题目1436：Repair the Wall

时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：298

解决：127

题目描述：

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.

样例输入：

5 3
3 2 1
5 2
2 1

样例输出：

2
impossible

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
int arr[600];
int sum[600];
bool cmp(int x,int y)
{
    return x>y;
}
int main()
{
    int N,L;//L:总长,N:木块数
    int i,j;
    int bigpos;
    int smallpos;
    int tmp;
    int flag;
    while(scanf("%d %d",&L,&N)!=EOF)
    {
        j=0;
        flag=0;
        for(i=0;i<N;i++)
        {
            scanf("%d",&tmp);
            if(tmp<L)
            {
             arr[j]=tmp;
             j++;
            }
        }
        if(j<N)//说明有长于或等于目标长度的木块，只需要一根就可以搞定
        {
            printf("1\n");

        }
        else
        {
            sort(arr,arr+j,cmp);
            sum[0]=arr[0];
            for(i=1;i<j;i++)
            {
                sum[i]=arr[i]+sum[i-1];
                if(sum[i]>=L)
                {
                    printf("%d\n",i+1);
                    flag=1;
                    break;

                }
            }
            if(flag==0)
            {
               printf("impossible\n");
            }

        }




    }


    return 0;
}