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.dancing;

import codejam.is.TestAbstract;

import java.util.StringTokenizer;

/**
 * Created with IntelliJ IDEA.
 * User: ofer
 * Date: 4/14/12
 * Time: 4:48 AM
 * To change this template use File | Settings | File Templates.
 */
public class DancingTest extends TestAbstract {


    @Override
    public void run(String s) {
        StringTokenizer tokenizer = new StringTokenizer(s);
        int numOfGooglers = Integer.parseInt(tokenizer.nextToken());
        int numOfSurprises = Integer.parseInt(tokenizer.nextToken());
        int bestResult = Integer.parseInt(tokenizer.nextToken());

        int result = 0;
        for (int i = 0; i < numOfGooglers; i++) {
            int score = Integer.parseInt(tokenizer.nextToken());
            if (score >= bestResult + 2*Math.max(bestResult-1, 0)) {
                result++;
            } else if (score >= (bestResult + 2*Math.max(bestResult-2, 0)) && numOfSurprises > 0) {
                result++;
                numOfSurprises--;
            }
        }

        output.append(result);
    }
}
