#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int L,N;
int length[700];
while( scanf("%d%d",&L,&N)!=EOF )
{
int sum=0;
int i;
for(i=0;i<N;i++)
{
scanf("%d",&length[i]);
sum+=length[i];
}
if(sum<L)
{
printf("impossible\n");
continue;
}
sort(length,length+N,cmp);
int cnt=0;
for(i=0;i<N;i++)
{
if(length[i]<L)
{
L-=length[i];
cnt++;
}
else
{
cnt++;
break;
}
}
printf("%d\n",cnt);
}
return 0;
}
hdu 2124 Repair the Wall 贪心
最新推荐文章于 2018-05-08 19:21:36 发布