public int minBoxes(int C, int X, int[] high)
	{
		Arrays.sort(high);
		int[] box = new int[high.length];
		for (int i = 0; C > 0 && i < box.length; i++) {
			box[i] = Math.min(high[i], C);
			C -= box[i];
		}
		int sum = 0;
		int count = 0;
		for (int i = box.length - 1; i >= 0; i--) {
			sum += box[i];
			count++;
			if (sum >= X) {
				return count;
			}
		}
		return -1;
	}