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);
	}

}


public class Scores {
	private int N;	// Number of Googlers
	private int S; 	// Number of surprising triplets of scores
	private int p;	// Score at least 
	private int[] t; 	// total point of Googlers

	public Scores(String str) {
		String[] tmpArr = str.split(" "); 
		N = Integer.parseInt(tmpArr[0]); 
		S = Integer.parseInt(tmpArr[1]);
		p = Integer.parseInt(tmpArr[2]);
		
		t = new int[N];
		for (int i=0; i<N; i++) {
			t[i] = Integer.parseInt(tmpArr[i+3]);
		}
	}
	
	public int getMaxNumberOfGooglerOverScore() {
		int minTNormal = 3 * p -2 ;  // Normal : p, p-1, p-1
		int minTSurprising = 3 * p - 4 ; // surprising triplets : p, p-2, p-2
		
		if (p == 0) {
			return t.length; 
		} else if (p == 1) {
			minTSurprising = 3 * p -2 ; // p, p-1, p-1 
		}
		
		
		int maxNumber = 0 ; 		
		int surpNumber = 0 ; 
		for (int i=0; i<N; i++) {
			if (t[i] >= minTNormal) {
				maxNumber++ ; 
			} else if (t[i] >= minTSurprising) {
				surpNumber++ ; 
			}
	 	}
		
		if (S < surpNumber) {
			surpNumber = S ;
		}
		
		return maxNumber+surpNumber; 
	}

}
