完美世界两道编程题

import java.util.Scanner;
//0-1背包
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int M = sc.nextInt();
		int w[] = new int[M];
		int p[] = new int[M];
		for (int i = 0; i < M; i  )
			p[i] = sc.nextInt();
		for (int i = 0; i < M; i  )
			w[i] = sc.nextInt();
		int t = sc.nextInt();
		int dp[][] = new int[M   1][t   1];
		for (int i = 1; i < M   1; i  )
			for (int j = 1; j < t   1; j  ) {
				if (j >= w[i-1]) {
					if (dp[i - 1][j] < dp[i - 1][j - w[i - 1]]   p[i - 1])
						dp[i][j] = dp[i - 1][j - w[i - 1]]   p[i - 1];
					else
						dp[i][j] = dp[i - 1][j];
				} else
					dp[i][j] = dp[i - 1][j];
			}
		System.out.println(dp[M][t]);
	}
}

import java.util.Scanner;
//硬币找零
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		int w = sc.nextInt();
		String[] strs = str.split(",");
		int n = strs.length;
		int[] p = new int[n];
		int d[] = new int[w   1];
		for (int i = 0; i < n; i  )
			p[i] = Integer.valueOf(strs[i]);
		int temp = 0;
		for (int i = 1; i <= w; i  ) {
			int min = i;
			for (int j = 0; j < n; j  ) {
				if (i >= p[j])
					temp = d[i - p[j]]   1;
				min = temp;
			}
			d[i] = min;
			temp=0;
		}
		if (d[w] == 0)
			System.out.println(-1);
		else
			System.out.print(d[w]);
	}
}