Acwing.多重背包问题

import java.util.*;
public class Main{
    public static void main(String[] args){
        int N=110;
        int[][] f=new int[N][N];
        int[] v=new int[N],w=new int[N],s=new int[N];
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int m=sc.nextInt();
        for(int i=1;i<=n;i++){
            v[i]=sc.nextInt();
            w[i]=sc.nextInt();
            s[i]=sc.nextInt();
        }
        for(int i=1;i<=n;i++)
            for(int j=0;j<=m;j++)
                for(int k=0;k<=s[i]&&k*v[i]<=j;k++)
                f[i][j]=Math.max(f[i][j],f[i-1][j-k*v[i]]+k*w[i]);
            
        System.out.println(f[n][m]);
    }
}