class Solution {

public:

    /**

     * @param m: An integer m denotes the size of a backpack

     * @param A: Given n items with size A[i]

     * @return: The maximum size

     */

    int backPack(int m, vector<int> A) {

        // write your code here

        int length = A.size();

        vector<vector<bool>> result(length+,vector<bool>(m+));

        for(int i = ;i <= m;i++)

            result[][i] = false;

        for(int j = ;j <= length;j++)

            result[j][] = true;

        for(int i = ;i <= length;i++){

            for(int j = ;j <= m;j++){

                if((j-A[i-]) >= )

                    result[i][j] = result[i-][j-A[i-]] || result[i-][j];

                else

                    result[i][j] = result[i-][j];

            }

        }

        int max = ;

        for(int i = ;i <= length;i++){

            for(int j = ;j <= m;j++){

                if(result[i][j] == true){

                    if(j > max)

                        max = j;

                }

            }

        }

        return max;

    }

};