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

public class DancingScores {

	private int[] scoreSums;
	private int numberSuprisingScores;
	private int threshold;

	public DancingScores(String inputLine) {
		String[] split = inputLine.split(" ");
		int length = Integer.parseInt(split[0]);
		scoreSums = new int[length];
		numberSuprisingScores = Integer.parseInt(split[1]);
		threshold = Integer.parseInt(split[2]);
		for (int i = 0; i < scoreSums.length; i++) {
			scoreSums[i] = Integer.parseInt(split[i + 3]);
		}
	}

	public int maxNumberScoresAboveThreshold() {
		if (threshold == 0) {
			return scoreSums.length;
		}
		if (threshold == 1) {
			return numberScoresAtLeastOne();
		}

		int googlersAbove = 0;
		int couldBeSurprising = 0;
		int alwaysUnderSum = 3 * threshold - 4;
		int alwaysAboveSum = 3 * threshold - 3;
		for (int i = 0; i < scoreSums.length; i++) {
			if (scoreSums[i] > alwaysAboveSum) {
				googlersAbove++;
			} else if (scoreSums[i] >= alwaysUnderSum) {
				couldBeSurprising++;
			}
		}
		return googlersAbove
				+ Math.min(numberSuprisingScores, couldBeSurprising);
	}

	private int numberScoresAtLeastOne() {
		int result = 0;
		for (int i = 0; i < scoreSums.length; i++) {
			if (scoreSums[i] >= 1) {
				result++;
			}
		}
		return result;
	}

}
