public static int findSecond(int[] times, int first) {
		int second = -1;
		int secondLowestTime = Integer.MAX_VALUE;

		for (int i = 0; i < times.length; i++) {
			if (i == first) // already checked
				continue;
			if (times[i] < secondLowestTime && times[i] > times[first]) {
				secondLowestTime = times[i];
				second = i;
			}
		}

		return second;
	}