uva 12563 - Jin Ge Jin Qu hao

/*************************************************************************
    > File Name: vj.cpp
    > Author: bxf
    > Mail: bbb546754186@vip.qq.com 
    > Created Time: 2014年08月04日 星期一 19时35分22秒
 ************************************************************************/

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <set>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0xfffffff
#define maxn 50 + 10
#define ll long long

using namespace std;
int a[maxn], dp[maxn][10000];
int main()
{
	int t, kase = 0;
	scanf("%d", &t);
	while(t--)
	{
		int n, tottime;
		scanf("%d%d", &n, &tottime);
		for(int i = 1; i <= n; ++i)
			scanf("%d", &a[i]);
		sort(a+1, a+n+1);
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		for(int i = 1; i <= n; ++i)
			for(int j = tottime-1; j >= a[i]; --j)
				for(int k = i; k >= 1; --k)
					if(dp[k-1][j-a[i]])
						dp[k][j] = 1;
		int ans = 0, num = 0;
		bool ok = false;
		for(int i = n; i>= 1; --i)
		{
			for(int j = tottime-1; j >= 0; --j)
				if(dp[i][j])
				{
					ans = j;
					num = i;
					ok = true;
					break;
				}
			if(ok) break;
		}
		printf("Case %d: %d %d\n", ++kase, num+1, ans+678);
	}
    return 0;
}