蓝桥杯 算法提高 01背包

AC代码：

import java.util.Arrays;import java.util.Scanner;public class Main {		public static void main(String[] args) {				Scanner in = new Scanner(System.in);		int n = in.nextInt();		int m = in.nextInt();		int[] widght = new int[210];		int[] value = new int[210];		int[] dp = new int[5010];		for (int i=0; i<n; ++i) {			widght[i] = in.nextInt();			value[i] = in.nextInt();		}		for (int i=0; i<n; ++i) {			for (int j=m; j>=widght[i]; j--) {				dp[j] = Math.max(dp[j], dp[j-widght[i]] + value[i]);			}		}		System.out.PRintln(dp[m]); 	}}