2487.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Memory:32K  Time:62MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <algorithm>
#include <functional>

int a[1000], n;

int main()
{
	int i,cas,need,borrow,k=1;
	scanf( "%d", &cas );
	
	while( cas-- )
	{
		scanf( "%d %d", &need, &n );
		for( i=0; i<n; i++ )
			scanf( "%d", &a[i] );
		
		std::sort( a, a+n, std::greater<int>() );

		for( borrow=0,i=0; borrow < need && i < n; i++ )
		{
			borrow += a[i];
		}
	
		printf( "Scenario #%d:\n", k++ );

		if( borrow < need )
			printf("impossible\n\n");
		else printf( "%d\n\n", i );
	}

	return 0;
}