01背包(java)

import java.util.Scanner;
public class Bag01{
    public static void main(String[] args) {
        Scanner inp=new Scanner(System.in);
        int n=inp.nextInt();
        int c=inp.nextInt();
        int w[]=new int[n];
        int v[]=new int[n];
        for(int i=0;i<n;i++)w[i]=inp.nextInt();
        for(int i=0;i<n;i++)v[i]=inp.nextInt();
        KnapSack(c,n,w,v);
    }
    public static void KnapSack(int c,int n,int w[],int v[]){
        int V[][]=new int[n+1][c+1];
        for(int i=0;i<=n;i++)V[i][0]=0;
        for(int j=0;j<=c;j++)V[0][j]=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=c;j++){
                if(j<w[i-1])V[i][j]=V[i-1][j];
                else V[i][j]=max(V[i-1][j],V[i-1][j-w[i-1]]+v[i-1]);
            }
        }
        int x[]=new int[n];
        int j=c;
        for(int i=n;i>0;i--){
            if(V[i][j]>V[i-1][j]){
                x[i-1]=1;
                j-=w[i-1];
            }else x[i-1]=0;
        }
        for(int i=0;i<n;i++) System.out.print(x[i]+" ");
    }
    public static int max(int a,int b){
        if(a>=b)return a;
        else return b;
    }
}