package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

package er.dream.codejam.train;

import java.util.ArrayList;
import java.util.List;

import er.dream.codejam.helpers.ProblemSolver;

public class DancingWithGooglers extends ProblemSolver{
	
	public static void main(String[] args) {
		new DancingWithGooglers().execute();
	}

	@Override
	protected List<String> handleInput() {
		List<String> result = new ArrayList<String>();
		int[] settings = fileHandler.readIntArray();
		
		for(int i=0;i<settings[0];i++){
			int[] numbers = fileHandler.readIntArray();
			int surprises = numbers[1];
			int minScore = numbers[2];
			
			int minimumScoreForUnsurprising = Math.max(0,3*minScore-2);
			int minimumScoreForSurprising = Math.max(0, 3*minScore-4);
			
			int surprisesMax = 0;
			int unsuprising = 0;
			
			int score;
			for(int j=3;j<numbers.length;j++){
				
				score = numbers[j];
				if(score < minScore)
					continue;
				
				if(score >= minimumScoreForUnsurprising)
					unsuprising++;
				else if(score >= minimumScoreForSurprising)
					surprisesMax++;
			}
			int maxGooglers = unsuprising + Math.min(surprises,  surprisesMax);
			result.add(""+maxGooglers);
		}
		
		return result;
	}

}
