3596709_wa.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main {
	private Scanner in;

	public static void main(String[] args) {
		new Main().run();
	}

	private void run() {
		in = new Scanner(System.in);
		int n, h;

		n = in.nextInt();
		h = in.nextInt();
		int[] height = new int[n];
		for (int i = 0; i < n; i++) {
			height[i] = in.nextInt();
		}
		Arrays.sort(height);
		int[] can = new int[h + height[n - 1] + 1];
		int ans = -1;
		can[0] = Integer.MAX_VALUE;
		for (int i = 0; i < h; i++) {
			if (can[i] != 0) {
				for (int j = 0; j < n; j++) {
					int t = i + height[j];
					if (can[t] == 0) {
						can[t] = Math.min(height[j], can[i]);
					} else {
						can[t] = Math.min(can[t], can[i]);
					}
				}
			}
		}
		for (int i = h; ; i++) {
			if (can[i] != 0) {
				ans = can[i];
				break;
			}
		}
		System.out.println(ans);
	}
}