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 com.codejam2012;

public class CodeJam2 {

	public static String fileDir = "P:\\CodeJam2012\\";
	public static String baseFileName = "B-small-attempt0";
	public static String inputFileName = fileDir + baseFileName + ".in";
	public static String outputFileName = fileDir + baseFileName + ".out";

	public static int Tcase;
	public static int Ccase = 0;
	public static String[] cases;
	public static Case singleCase;

	public static void main(String[] args) {

		FileUtils.deleteFile(outputFileName);
		String inputString = FileUtils.readFile(inputFileName);
		parseInputString(inputString);
		for (; Ccase < Tcase;) {
			parse();
		}
	}

	public static void parseInputString(String inputString) {

		cases = inputString.split("\n");
		Tcase = Integer.parseInt(cases[0]);
		Ccase = 0;
	}

	private static void parse() {

		Ccase++;
		FileUtils.appendToFile(outputFileName, "Case #" + Ccase + ": ");
		singleCase = new Case(cases[Ccase]);
		singleCase.execute();
		FileUtils.appendToFile(outputFileName, singleCase.getDataToPrint()
				+ "\n");

	}

	public static class Case {
		StringBuilder outputStatement;
		private int N, S, P;
		private int[] G;
		private boolean[][] B; // greater than p , surprising , both

		public Case(String caseString) {
			outputStatement = new StringBuilder();
			String[] arr = caseString.split(" ");
			N = Integer.parseInt(arr[0]);
			S = Integer.parseInt(arr[1]);
			P = Integer.parseInt(arr[2]);
			G = new int[N];
			B = new boolean[N][3];

			for (int i = 0; i < G.length; i++) {
				G[i] = Integer.parseInt(arr[i + 3]);
			}
			java.util.Arrays.sort(G);
		}

		public void execute() {

			for (int loop = 0; loop < G.length; loop++) {
				checkANumberForSurprisingAndDeleteSurprising(G[loop], loop);

			}

			int finalYeild = 0;
			for (int loop = 0; loop < N; loop++) {
				// if(S >= 1){
				// if(B[loop][2] == true){
				// S--;
				// finalYeild++;
				// }else if(B[loop][1] == true){
				// S--;
				// }else if(B[loop][0] == true){
				// finalYeild++;
				// }
				// }else{
				// if(B[loop][0] == true){
				// finalYeild++;
				// }
				// }

				if (S >= 1) {
					if (B[loop][2] == true) {
						S--;
						finalYeild++;
						B[loop][0] = false;
						B[loop][1] = false;
						B[loop][2] = false;
					}
				}

			}

			for (int loop =0; loop < G.length; loop++) {
				if (S >= 1) {
					if (B[loop][1] == true) {
						S--;
					} else if (B[loop][0] == true) {
						finalYeild++;
					}
				} else {
					if (B[loop][0] == true) {
						finalYeild++;
					}
				}

			}

			outputStatement.append(finalYeild);

		}

		private void checkANumberForSurprisingAndDeleteSurprising(
				int underprocess, int index) {

			int s[] = { underprocess / 3, underprocess / 3, underprocess / 3 };

			int seed = -2;
			int endseed = 2;
			for (int i = seed; i <= endseed; i++) {
				s[0] = underprocess / 3 + i;
				if (s[0] != Math.abs(s[0])) {
					continue;
				}
				for (int t = seed; t <= endseed; t++) {
					s[1] = underprocess / 3 + t;
					if (s[1] != Math.abs(s[1])) {
						continue;
					}
					for (int u = seed; u <= endseed; u++) {
						s[2] = underprocess / 3 + u;
						if (s[2] != Math.abs(s[2])) {
							continue;
						}
						if ((s[0] + s[1] + s[2]) == underprocess) {
							if (Math.abs(s[0] - s[1]) > 2
									|| Math.abs(s[0] - s[2]) > 2
									|| Math.abs(s[2] - s[1]) > 2) {

							} else if (Math.abs(s[0] - s[1]) == 2
									|| Math.abs(s[0] - s[2]) == 2
									|| Math.abs(s[2] - s[1]) == 2) {
								if (s[0] >= P || s[1] >= P || s[2] >= P) {
									B[index][2] = true;
								} else {
									B[index][1] = true;
								}
							} else if (Math.abs(s[0] - s[1]) < 2
									|| Math.abs(s[0] - s[2]) < 2
									|| Math.abs(s[2] - s[1]) < 2) {

								if (s[0] >= P || s[1] >= P || s[2] >= P) {
									B[index][0] = true;
								}
							}
						}

					}
				}

			}

		}

		public String getDataToPrint() {
			return outputStatement.toString();

		}

	}
}
