package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

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

}
