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 com.dagova.dancingWithTheGooglers;

public class DancingWithTheGooglersSolver
{
	private int solution;
	private int bestScore;
	private int surprisedTriplets;
	private int numberOfGooglers;
	
	
	public DancingWithTheGooglersSolver()
	{
		solution = 0;
	}
	
	
	private void checkTotalPoints(int googlerTotalPoints)
	{
		float quotient = googlerTotalPoints / 3f;
		
		if(quotient >= bestScore)
			solution++;
		else
		{
			googlerTotalPoints -= bestScore;
			if(googlerTotalPoints >= 0)
			{
				quotient = googlerTotalPoints / 2f;
				if(quotient + 1 >= bestScore)
					solution++;
				else
				{
					if(surprisedTriplets > 0 && quotient + 2 >= bestScore)
					{
						surprisedTriplets--;
						solution++;
					}
				}
			}
		}
	}
	
	
	public int solve(String line)
	{
		String[] splittedLine = line.split(" ");
		numberOfGooglers = Integer.parseInt(splittedLine[0]);
		surprisedTriplets = Integer.parseInt(splittedLine[1]);
		bestScore = Integer.parseInt(splittedLine[2]);
		
		for(int googler = 0; googler < numberOfGooglers; googler++)
		{
			checkTotalPoints(Integer.parseInt(splittedLine[3+googler]));
		}
		
		return solution;
	}
}
