comefrom: <awangdev>Backpack II_7.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[A.length + 1][m + 1];
      	dp[0][0] = 0; 
  
      	for (int i = 1; i <= A.length; i++) {
      		for (int j = 0; j <= m; j++) {
      			if (j - A[i - 1] >= 0) {
      				dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - A[i - 1]] + V[i - 1]);
      			} else {
      				dp[i][j] = dp[i - 1][j];
      			}
      		}
      	}
  
      	return dp[A.length][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_7 = new int [ var_1 . length + 1 ] [ var_0 + 1 ] ;
    var_7 [ 0 ] [ 0 ] = 0 ;
    for ( int var_8 = 1 ;
    var_8 <= var_1 . length ;
    var_8 ++ ) {
      for ( int var_9 = 0 ;
      var_9 <= var_0 ;
      var_9 ++ ) {
        if ( var_9 - var_1 [ var_8 - 1 ] >= 0 ) {
          var_7 [ var_8 ] [ var_9 ] = Math . max ( var_7 [ var_8 - 1 ] [ var_9 ] , var_7 [ var_8 - 1 ] [ var_9 - var_1 [ var_8 - 1 ] ] + var_2 [ var_8 - 1 ] ) ;
        }
        else {
          var_7 [ var_8 ] [ var_9 ] = var_7 [ var_8 - 1 ] [ var_9 ] ;
        }
      }
    }
    return var_7 [ var_1 . length ] [ var_0 ] ;
  }
  