Java版--背包问题（最大价值及其包含的物品）

public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int c = input.nextInt();

        int[] w = new int[n+1];
        int[] v = new int[n+1];
        int[] flag = new int[n + 1];

        int[][] dp = new int[n+1][c+1];

        for (int i = 1; i <= n; i++){
             w[i] = input.nextInt();
             v[i] = input.nextInt();
        }

        int max = 0;

        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= c; j++){
                if (j < w[i]){
                    dp[i][j] = dp[i-1][j];
                }else {
                    dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j-w[i]] + v[i]);
                }
                if (dp[i][j] > max){
                    max = dp[i][j];
                }
            }
        }
        System.out.println(max);

        checkFlag(n,c,flag,dp,w,v);

        for (int i = 1; i <= n; i++){
            if (flag[i] == 1){
                System.out.print(i+" ");
            }
        }
    }

    public static void checkFlag(int i, int j, int[] flag, int[][] dp, int[] w, int[] v){
        if (i > 0){
            if (dp[i][j] == dp[i - 1][j]) {
                flag[i] = 0;
                checkFlag(i - 1, j, flag, dp, w, v);
            }
            else if (j - w[i] >= 0 && dp[i][j] == dp[i - 1][j - w[i]] + v[i]) {
                flag[i] = 1;
                checkFlag(i - 1, j - w[i], flag, dp, w, v);
            }
        }
    }