uva1612(直接根据题意贪心)

思路：三门分数，然后就是8种组合，先预处理出来每种组合，然后就是根据题意去贪心了，，，然前面的分数在满足条件的情况下尽量高。

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int Readint(){
	char c = getchar();
	while(!isdigit(c)) c = getchar();
	int x = 0;
	while(isdigit(c)){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x;
}
struct people{
	int score[10];//2*2*2=8种组合
}p[20010];
int id[20010];
int main()
{	
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int n;
	int icase = 0;
	while(~scanf("%d",&n) && n){
		double a[4];
		for (int i = 1;i <= n;++i){
			scanf("%lf%lf%lf",&a[0],&a[1],&a[2]);
			for (int j = 0;j < 8;++j){
				p[i].score[j] = 0;
				for (int k = 0;k < 3;k++){
					if (j & (1 << k))
						p[i].score[j] += (int)((a[k] * 100.000000001));
				}
			}
			sort(p[i].score,p[i].score + 8);
		}
		for (int i = 1;i <= n;i++)
			scanf("%d",&id[i]);
		int high = p[id[1]].score[7];
		int pre = id[1];
		int i;
		for (i = 2;i <= n;++i){
			bool flag = false;
			for (int j = 7;j >= 0;--j){
				if (p[id[i]].score[j] == high && id[i] > pre){
					flag = true;
					pre = id[i];
					break;
				}
				else if (p[id[i]].score[j] < high){
					flag = true;
					pre = id[i];
					high = p[id[i]].score[j];
					break;
				}
			}
			if (!flag) break;
		}
		printf("Case %d: ",++icase);
		if (i != n + 1) printf("No solution\n");
		else printf("%.2lf\n",high/100.0);
	}
	return 0;
}