蓝桥杯#装饰珠

//自己的答案，仅供参考
import java.util.Scanner;

public class D5 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int[] k = new int[4+1];
        for(int i = 0; i < 6; i++){
            int a = in.nextInt();
            while(a--!=0){
                k[in.nextInt()]++;
            }
        }
        int b = in.nextInt();
        int[][] grade = new int[5][8];
        while(b--!=0){
            int c = in.nextInt();
            grade[c][0] = in.nextInt();
            for(int j = 1; j <= grade[c][0]; j++){
                grade[c][j] = in.nextInt();
            }
        }

        // 一共6件装备，等级孔为1~4级，各等级孔数量如下：
        // k[]
        // 各等级孔的属性叠加与上限：
        // grade[][]    0为非值

        int v = k[1]+k[2]+k[3]+k[4];
        int sum = 0;
        for(int i = 0; i <= v; i++){
            int j1 = Math.min(k[2]+k[3]+k[4],v-i);
            for(int j = 0; j <= j1; j++){
                int r1 = Math.min(k[3]+k[4],v-i-j);
                for(int r = 0; r <= r1; r++){
                    int t1 = Math.min(k[4],v-i-j-r);
                    for(int t = 0; t <= t1; t++){
                        int count = 0;
                        count += i==0?0:i>=grade[1][1]?grade[1][grade[1][1]+1]:grade[1][i+1];
//                        System.out.print(count + " ");
                        count += j==0?0:j>=grade[2][1]?grade[2][grade[2][1]+1]:grade[2][j+1];
//                        System.out.print(count + " ");
                        count += r==0?0:r>=grade[3][1]?grade[3][grade[3][1]+1]:grade[3][r+1];
//                        System.out.print(count + " ");
                        count += t==0?0:t>=grade[4][1]?grade[4][grade[4][1]+1]:grade[4][t+1];

                        sum = Math.max(count,sum);
                        System.out.println("i:" + i + ",j:"+j+",r:"+r+",t："+t+",count：" + count + ",SUM:" + sum);

                    }
                }
            }
        }
//        System.out.println(sum);
    }
}