2314.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2314 on 2006-08-13 at 20:29:42 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1024;

int main()
{
	int i, T, f[N], n, b;
	
	scanf("%d", &T);
	for(int t = 1; t <= T; t++) {
		scanf("%d %d", &b, &n);
		for(i = 0; i < n; i++) scanf("%d", &f[i]);
		sort(f, f+n);
		for(i = n-1; i >= 0 && b > 0; i--) b -= f[i];
		printf("Scenario #%d:\n", t);
		if(b > 0) printf("impossible\n\n");
		else printf("%d\n\n", n-i-1);
	}
	
	return 0;
}