import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * 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. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package se.pathed.codejam.practice.dansingwithgooglers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class DancingWithGooglers {

	public File getFileFromDisk(String fileName){
		String dataFolder = "C:\\Users\\Patrik\\workspaces\\codejam\\Practis\\data\\";
		return new File(dataFolder + fileName);
	}

	public static void main(String[] args) throws IOException{
		new DancingWithGooglers().run();
	}

	public static class Problem {
		int numDancers;
		int numSupprises;
		int searched;
		int solution;
		int[] scores;
	}
	
	public Problem[] parseInput() throws IOException{
		File f = getFileFromDisk("B-large.in");
		FileReader fReader = new FileReader(f);
		BufferedReader reader = new BufferedReader(fReader);
		
		int numCases = Integer.parseInt(reader.readLine());
		Problem[] probs = new Problem[numCases];
		
		for( int i = 0; i < numCases; i++){
			Problem p = new Problem();
			String[] strInp = reader.readLine().split(" ");
			p.numDancers = Integer.parseInt(strInp[0]);
			p.numSupprises = Integer.parseInt(strInp[1]);
			p.searched = Integer.parseInt(strInp[2]);
			
			p.scores = new int[p.numDancers];
			for( int x = 3; x < strInp.length; x++){
				p.scores[x-3] = Integer.parseInt(strInp[x]);
			}
			probs[i] = p;
		}
		
		return probs;
	}
	
	private void run() throws IOException {
		Problem[] problems = parseInput();
		
		File outputFile = getFileFromDisk("out.txt");
		if( outputFile.exists()) outputFile.delete();
		PrintWriter outFile = new PrintWriter(outputFile);
		
		for( int i = 0; i < problems.length; i++){
			Problem p = problems[i];
			
			int lowestScore = ( p.searched * 3) -2;
			int lowestSuppriseScore = lowestScore - 2;

			int possibleScore = 0;
			int possibleSupprise = 0;
			
			for( int sc : p.scores ){
				if( sc >= lowestScore){
					possibleScore++;
				} else if( sc >= lowestSuppriseScore && sc > 0){
					possibleSupprise++;
				}
			}
			
			p.solution = possibleScore + (possibleSupprise > p.numSupprises ? p.numSupprises : possibleSupprise);
			
			outFile.println("Case #" + (1+i) + ": " + p.solution);
		}
		outFile.flush();
	}
}
