题解 | #【模板】完全背包#

和01背包的区别就是可以无限取一个物品，这样就要求外循环是容量，内循环是物品的种类

利用二维循环也是比较好理解

for (int i = 1; i <= n; i++) {
  for (int j = v[i]; j <= V; j++) {
    int num = j / v[i];
    for (int k = 1; k <= num; k++) {
      dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - k * v[i]] + k * w[i]);
    }
  }
}

import java.util.Arrays;
import java.util.Scanner;

/**
 * @program: springDemo
 * @author: JiaLe Hu
 * @create: 2022-03-18 16:02
 **/

public class Main {
    public static void main(String[] args) {
        Scanner reader = new Scanner(System.in);
        int n = reader.nextInt();
        int V = reader.nextInt();
        int[] v = new int[n + 1];
        int[] w = new int[n + 1];

        for (int i = 1; i <= n; i++) {
            v[i] = reader.nextInt();
            w[i] = reader.nextInt();
        }
        // init
        int[] dp = new int[V + 1];
        Arrays.fill(dp, Integer.MIN_VALUE);
        dp[0] = 0;
        // dp[i][j] = dp[i - 1][j], dp[i - 1][j - nums * v[i]] + num * w[i];
        for (int i = 0; i <= V; i++) {
            for (int j = 1; j <= n; j++) {
                if (i >= v[j]) {
                    dp[i] = Math.max(dp[i], dp[i - v[j]] + w[j]);
                }
            }
        }
        int res = 0;
        for (int i = 1; i <= V; i++) {
            res = Math.max(res, dp[i]);
        }
        System.out.println(res);
        System.out.println(Math.max(dp[V], 0));
    }
}