HDU 2124 Repair the Wall

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn=610;

int len[maxn],n,L;
int main(){
	while (scanf("%d%d",&L,&n)==2)
	{
		long long tl=0;
		for (int i=0;i<n;++i){
			scanf("%d",&len[i]);
			tl+=len[i];
		}
		if(tl<L)printf("impossible\n");
		else{
			sort(len,len+n,greater<int>());
			int i,curL=0;
			for (i=0;i<n&&curL<L;++i)
			{
				curL+=len[i];
			}
			printf("%d\n",i);
		}
	}
	return 0;
}