算法提高 01背包

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        int weight = in.nextInt();
        int[] n = new int[num];
        int[] value = new int[num];
        int[] dp = new int[weight+1];
        for ( int i = 0 ; i < num ; i++){
            n[i] = in.nextInt();
            value[i] = in.nextInt();
        }
        for (int i = 0 ; i < num ; i++){
            for ( int j = weight ; j >= n[i] ; j--){
                 dp[j] = Math.max(dp[j], dp[j-n[i]]+value[i]);  
            }
        }
        System.out.println(dp[weight]);
        in.close();
    }

}