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.mohit.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			int noOfTests = 0;
			int noGooglers = 0;
			int surprises = 0;
			int exp_score = 0;
			int total_score = 0;
			int without_surprise = 0;
			int with_surprise = 0;
			
			int judges_score[] = new int[3];
			int some_temp = 0;
			
			FileInputStream fis = new FileInputStream("input.txt");
			DataInputStream din = new DataInputStream(fis);
			BufferedReader br = new BufferedReader(new InputStreamReader(din));
			
			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			
			String strLine;
			strLine = br.readLine();
			if(strLine == null || strLine == "")
				return;
			
			strLine = strLine.trim();
			noOfTests = Integer.parseInt(strLine);
			
			int testNumber = 1;
			
			while(noOfTests>0)
			{
				String output = "";
				strLine = br.readLine();
				if(strLine == null || strLine == "" || strLine == "\n" )
					break;	
				strLine = strLine.trim().toLowerCase();
				
				String[] records= strLine.split(" ");
				noGooglers = Integer.parseInt(records[0]);
				surprises = Integer.parseInt(records[1]);
				exp_score = Integer.parseInt(records[2]);
				
				without_surprise = 0;
				with_surprise = 0;
				
				// loop to get the various scores and store it in array
				for (int i = 0; i < noGooglers; i++)
				{
					//logic to find score such that difference between them is not more than 1
					total_score = Integer.parseInt(records[2 + i + 1]);
					judges_score[0] = total_score / 3;
					judges_score[1] = (total_score - judges_score[0]) / 2;
					judges_score[2] = total_score - judges_score[0] - judges_score[1];
					
					// sort the judges score
					for (int k = 0;k<3;k++)
					{
						for (int l = k+1; l<3;l++)
						{
							if (judges_score [k] > judges_score [l])
							{
								some_temp = judges_score [k];
								judges_score [k] = judges_score [l];
								judges_score [l] = some_temp;
							}
						}
					}
					if (judges_score [2] >= exp_score)
						without_surprise ++;
					else if (judges_score [2] == (exp_score-1) && (total_score - judges_score [2] > 0) && (judges_score[1] == judges_score[2]))
						with_surprise ++;

				}
				if (with_surprise > surprises)
					with_surprise = surprises;
			
				out.write("Case #" + testNumber  + ": " + (without_surprise + with_surprise) + "\n");	
				testNumber ++;
				}
			br.close();
			out.close();
			}
		catch(IOException e)
		{
			System.out.print(e.getMessage());
		}
		finally
		{
		
		}

	}

}
