package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

package proba;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class ProblemB {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {

		Map<Integer, Set<Score>> map = new HashMap<Integer, Set<Score>>();
		Map<Integer, Set<Score>> surprises = new HashMap<Integer, Set<Score>>();
		for (int j1 = 0; j1 <= 10; j1++) {
			for (int j2 = 0; j2 <= 10; j2++) {
				for (int j3 = 0; j3 <= 10; j3++) {
					if (Math.abs(j1 - j2) > 2 || Math.abs(j2 - j3) > 2
							|| Math.abs(j1 - j3) > 2) {
						continue;
					}
					int sum = j1 + j2 + j3;
					if (Math.abs(j1 - j2) == 2 || Math.abs(j2 - j3) == 2
							|| Math.abs(j1 - j3) == 2) {
						if (!surprises.containsKey(sum)) {
							Set<Score> list = new HashSet<Score>();
							Score score = new Score(j1, j2, j3);
							list.add(score);
							surprises.put(sum, list);
						} else {
							Set<Score> list = surprises.get(sum);
							Score score = new Score(j1, j2, j3);
							list.add(score);
							surprises.put(sum, list);
						}
					} else {
						if (!map.containsKey(sum)) {
							Set<Score> list = new HashSet<Score>();
							Score score = new Score(j1, j2, j3);
							list.add(score);
							map.put(sum, list);
						} else {
							Set<Score> list = map.get(sum);
							Score score = new Score(j1, j2, j3);
							list.add(score);
							map.put(sum, list);
						}
					}
				}
			}
		}
		Scanner s = new Scanner(new FileInputStream("B-small-attempt0.in"));
		int cases = s.nextInt();
		s.nextLine();

		for (int i = 0; i < cases; i++) {
			int N = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();
			int[] scores = new int[N];
			int answer = 0;
			int noOfSurprises = 0;
			for (int j = 0; j < N; j++) {
				scores[j] = s.nextInt();
			}
			if (s.hasNextLine())
				s.nextLine();
			for (int j = 0; j < N; j++) {
				Set<Score> normal = map.get(scores[j]);
				Set<Score> surps = surprises.get(scores[j]);
				boolean foundInNormal = false;
				for (Score score1 : normal) {
					if (score1.isScoreAbove(p)) {
						answer++;
						foundInNormal = true;
					}
				}
				if (!foundInNormal) {
					if (surps != null && noOfSurprises < S ) {
						for (Score score1 : surps) {
							if (score1.isScoreAbove(p)) {
								answer++;
								noOfSurprises++;
							}
						}
					}
				}
				/*
				else if (surps != null && noOfSurprises < S
						&& surps.size() > S) {
					// for()
					// comb1(combstr);

					Map<Integer, Set<Score>> best = new HashMap<Integer, Set<Score>>();
					for (Score score1 : surps) {
						int subanswer = 0;
						if (score1.isScoreAbove(p)) {
							answer++;
							foundInNormal = true;
						}
						if (!best.containsKey(subanswer)) {
							Set<Score> list = new HashSet<Score>();
							list.add(score1);
							best.put(subanswer, list);
						} else {
							Set<Score> list = map.get(subanswer);
							list.add(score1);
							best.put(subanswer, list);
						}
					}
					Set<Integer> bests = best.keySet();
					List<Integer> bestList = new ArrayList<Integer>(bests);
					Collections.sort(bestList);
					for (int n = 0; n < S; n++) {
						Integer h = bestList.get(bestList.size() - (1 + n));
						answer = answer + h;
					}
					for (Score score : normal) {
						if (score.isScoreAbove(p)) {
							answer++;
						}
					}

				} else {
					for (Score score : normal) {
						if (score.isScoreAbove(p)) {
							answer++;
							googlers[j] = new Googler(score, scores[j]);
						}
					}
				}*/
			}
			System.out.println("Case #" + (i + 1) + ": " + answer);
		}

	}

	private static class Score {
		int a;
		int b;
		int c;

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + a;
			result = prime * result + b;
			result = prime * result + c;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Score other = (Score) obj;
			if (a != other.a)
				return false;
			if (b != other.b)
				return false;
			if (c != other.c)
				return false;
			return true;
		}

		public Score(int a, int b, int c) {
			super();
			int[] arr = { a, b, c };
			Arrays.sort(arr);
			this.a = arr[0];
			this.b = arr[1];
			this.c = arr[2];
		}

		public boolean isScoreAbove(int p) {
			if (a >= p || b >= p || c >= p)
				return true;
			return false;
		}

		@Override
		public String toString() {
			return "[" + a + ", " + b + ", " + c + "]";
		}

	}

}
