01背包问题Java

package day0305;

import java.util.Scanner;

public class 背包问题 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int M = scan.nextInt();
		int [] V = new int[N];
		int [] W = new int[N];
		for (int i = 0; i < W.length; i++) {
			V[i] = scan.nextInt();
			W[i] = scan.nextInt();
		}
		int[][] arr = new int[N][M+1];
		for (int i = 0; i < arr[0].length; i++) {
			arr[0][i] = i >= V[0] ? W[0] : 0;
		}
		for (int i = 1; i < N; i++) {
			for (int j = 0; j <=M; j++) {
				int x = arr[i-1][j];
				int y = j >= V[i] ? arr[i-1][j-V[i]]+W[i] : 0;
				arr[i][j] = Math.max(x, y);
			}
		}
		
		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr[i].length; j++) {
				System.out.print(arr[i][j]+"\t");
			}
			System.out.println();
		}
		
		System.out.println(arr[N-1][M]);
		
	}

}