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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;

class Dance_B {
	List<Bcase> cases = new ArrayList<>();
	
	private static class Bcase{
		int targetScore, surprises;
		List<Integer> totals = new ArrayList<>();
		int answer;
	}

	public static void main(String[] args) {
		Dance_B dance = new Dance_B();

		File infile = new File(args[0]);
		File outfile = new File(infile.getParent(), "b.out.txt");

		dance.parse(infile);
		dance.solve();
		dance.output(outfile);
	}

	/**
	 * Pop the highest sorted totals. Utilize surprise scores to achieve max spread for max results  
	 */
	void solve() {
		for(Bcase bcase : cases){
			//e.g.: desire 8, score=8 7 7
			int minBaseline = Math.max(bcase.targetScore * 3 - 2, 0);
			
			//e.g.: desire 8, score = 8 6 6
			int minSurpriseBaseline = Math.max(bcase.targetScore * 3 - 4, 0);
			
			//sort and build stack
			Collections.sort(bcase.totals);
			Stack<Integer> stack = new Stack<>();
			for(int i: bcase.totals){
				stack.push(i);
			}
			
			while(!stack.isEmpty()){
				//highest total on the stack
				int aScore = stack.pop();
				
				//special case for 0 total. A 0 total means each vote is 0
				if(aScore == 0 ){
					if(bcase.targetScore == 0){
						bcase.answer++;
					}
				} else if(aScore >= minBaseline){
					//done, easy spread
					bcase.answer++;
				} else if (bcase.surprises > 0){
					//attempt to use a surprise score
					if(aScore >= minSurpriseBaseline){
						bcase.surprises--;
						bcase.answer++;
					}
				}
			}
		}
	}

	void parse(File infile) {
		try (Scanner scanner = new Scanner(infile)) {
			int numCases = Integer.parseInt(scanner.nextLine());
			for (int i = 0; i < numCases; i++) {
				Bcase bcase = new Bcase(); 
				final int n = scanner.nextInt();
				bcase.surprises = scanner.nextInt();
				bcase.targetScore = scanner.nextInt();
				
				for(int x=0; x<n; x++){
					bcase.totals.add(scanner.nextInt());
				}
				cases.add(bcase);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	void output(File outfile) {
		try (BufferedWriter bw = new BufferedWriter(new FileWriter(outfile))) {
			int i=1;
			for(Bcase bcase : cases){
				bw.write(String.format("Case #%d: %d\n", i++, bcase.answer));
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
