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 sholay;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

/**
 * GoogleDancers
 */
public class GoogleDancers {

	public static String INPUT_FILE_NAME = "B-small-attempt0.in";
	public static String OUTPUT_FILE_NAME = "B-small-attempt0.out";

	class Player implements Comparable<Player> {

		int totalScore;
		int x;
		int y;
		int z;
		int thresholdScore;
		boolean isSurprise;
		boolean isMax;

		/**
		 * @param totalScore
		 * @param thresholdScore
		 * @param x
		 * @param y
		 * @param z
		 */
		Player(int totalScore, int thresholdScore, int x, int y, int z) {
			this.totalScore = totalScore;
			this.thresholdScore = thresholdScore;
			this.x = x;
			this.y = y;
			this.z = z;
			isSurprise = (Math.abs(x - y) >= 2d || Math.abs(y - z) >= 2d || Math
					.abs(x - z) >= 2d);
			isMax = (x >= thresholdScore) || (y >= thresholdScore)
					|| (z >= thresholdScore);
		}

		@Override
		public int compareTo(Player arg0) {
			return (isMax && !isSurprise) ? 1
					: ((isMax && isSurprise) ? 0 : -1);
		}
	}

	//
	Map<Integer, java.util.List<Player>> map = new HashMap<Integer, java.util.List<Player>>();

	/**
	 * Read the input file, decode the input and write the output file
	 * 
	 * @throws IOException
	 */
	public void solve() throws IOException {
		BufferedReader in = null;
		PrintWriter out = null;
		try {
			in = new BufferedReader(new FileReader(getFile(INPUT_FILE_NAME)));
			out = new PrintWriter(new FileWriter(OUTPUT_FILE_NAME));
			String line = null;
			int lineNum = 0;
			int numTestCase = 0;
			int count = 0;
			while ((line = in.readLine()) != null) {
				if (lineNum >= 0) {
					if (lineNum == 0) {
						numTestCase = Integer.parseInt(line);
					} else {
						count++;
						if (count <= numTestCase) {
							int solution = getMaxBestResult(line);
							out.write("Case #" + count + ": " + solution);
							if (count != numTestCase) {
								out.write("\n");
							}
						} else {
							break;
						}
					}
				}
				lineNum++;
			}

		} catch (Exception ex) {
			System.out.println("Program failed :" + ex.getMessage());
		} finally {
			in.close();
			out.close();
		}
	}

	/**
	 * @param line
	 * @return
	 */
	private int getMaxBestResult(String line) {
		map.clear();
		String[] lineArray = line.split(" ");
		int totalPlayers = Integer.parseInt(lineArray[0]);
		if (totalPlayers > 0) {
			int surprise = Integer.parseInt(lineArray[1]);
			int threshold = Integer.parseInt(lineArray[2]);
			for (int i = 0; i < totalPlayers; i++) {
				List<Player> players = getPossiblePlayers(surprise, threshold,
						Integer.parseInt(lineArray[3 + i]));
				map.put(i, players);
			}
			return findMaxBest(surprise, map);
		}
		return 0;
	}

	/**
	 * @param surprise
	 * @param map
	 * @return
	 */
	private int findMaxBest(int surprise, Map<Integer, List<Player>> map) {
		int maxBest = 0;
		Set<Integer> players = map.keySet();
		for (Integer player : players) {
			List<Player> possibility = map.get(player);
			Player p = getPlayer(surprise, possibility);
			if (p != null) {
				if (p.isMax) {
					maxBest++;
				}
				if (p.isSurprise) {
					surprise--;
				}
			}
		}
		return maxBest;
	}

	/**
	 * @param surprise
	 * @param possibility
	 * @return
	 */
	private Player getPlayer(int surprise, List<Player> possibility) {
		Player pp = null;
		Collections.sort(possibility,Collections.reverseOrder());
		for (Player p : possibility) {
			if (p.isMax && !p.isSurprise) {
				pp = p;
			break;
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (p.isMax && p.isSurprise && surprise > 0) {
					pp = p;
				break;
				}
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (!p.isSurprise && surprise <= 0) {
					pp = p;
				break;
				}
			}
		}
		if (pp == null) {
			for (Player p : possibility) {
				if (!p.isSurprise) {
					pp = p;
				break;
				}
			}
		}
		return pp;
	}

	/**
	 * @param surprise
	 * @param threshold
	 * @param i
	 * @return
	 */
	private List<Player> getPossiblePlayers(int surprise, int threshold,
			int totalScore) {
		List<Player> players = new ArrayList<Player>();
		//
		if ((totalScore) % 3 == 0) {
			int div = (totalScore) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div, div));
			}
		}
		//
		if ((totalScore - 1) % 3 == 0) {
			int div = (totalScore - 1) / 3;
			if(div>=0){
				players.add(new Player(totalScore, threshold, div, div, div + 1));
			}
		}
		//
		if ((totalScore - 2) % 3 == 0) {
			int div = (totalScore - 2) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 1, div + 1));
				players.add(new Player(totalScore, threshold, div, div, div + 2));
			}
		}
		//
		if ((totalScore - 3) % 3 == 0) {
			int div = (totalScore - 3) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 1, div + 2));
			}
		}
		//
		if ((totalScore - 4) % 3 == 0) {
			int div = (totalScore - 4) / 3;
			if(div>=0) {
				players.add(new Player(totalScore, threshold, div, div + 2, div + 2));
			}
		}
		return players;
	}

	/**
	 * @param fileName
	 * @return
	 */
	public static File getFile(String fileName) {
		return new File(fileName);
	}

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		GoogleDancers googleDancers = new GoogleDancers();
		googleDancers.solve();
	}

}
