comefrom: <awangdev>Backpack II_8.java
code: public int backPackII(int m, int[] A, int V[]) {
      	if (A == null || V == null || A.length == 0 || V.length == 0 || A.length != V.length || m <= 0) {
      		return 0;
      	}
      	int[]dp = new int[m + 1];
      	dp[0] = 0; 
  
      	for (int i = 1; i <= A.length; i++) {
      		for (int j = m; j >= 0; j--) {
      			if (j - A[i - 1] >= 0 && dp[j - A[i - 1]] + V[i - 1] > dp[j]) {
      				dp[j] = dp[j - A[i - 1]] + V[i - 1];
      			} 
      		}
      	}
  
      	return dp[m];
      }
masked: public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) {
    if ( var_1 == null || var_2 == null || var_1 . length == 0 || var_2 . length == 0 || var_1 . length != var_2 . length || var_0 <= 0 ) {
      return 0 ;
    }
    int [ ] var_3 = new int [ var_0 + 1 ] ;
    var_3 [ 0 ] = 0 ;
    for ( int var_4 = 1 ;
    var_4 <= var_1 . length ;
    var_4 ++ ) {
      for ( int var_5 = var_0 ;
      var_5 >= 0 ;
      var_5 -- ) {
        if ( var_5 - var_1 [ var_4 - 1 ] >= 0 && var_3 [ var_5 - var_1 [ var_4 - 1 ] ] + var_2 [ var_4 - 1 ] > var_3 [ var_5 ] ) {
          var_3 [ var_5 ] = var_3 [ var_5 - var_1 [ var_4 - 1 ] ] + var_2 [ var_4 - 1 ] ;
        }
      }
    }
    return var_3 [ var_0 ] ;
  }
  