01背包问题

#include <iostream>
#include <vector>
#define max(a,b) a>b ? a:b
using namespace std;

int main()
{
    int capacity;
    int number;
    cout<<"输入包的容量和物品的数量"<<endl;
    cin>>capacity>>number;
    vector<int> weight(number+1);
    vector<int> value(number+1);
    vector<vector<int> > array(number+1,vector<int>(capacity+1,0) );
    cout<<"按顺序输入所有重量"<<endl;
    for (int i = 1; i <= number; ++i)
    {
        cin>>weight[i];
    }
    cout<<"按顺序输入所有价值"<<endl;
    for (int i = 1; i <= number; ++i)
    {
        cin>>value[i];
    }

    for (int i = 1; i <= number; ++i)
    {
        for (int j = 0; j <= capacity; ++j)
        {
            if (j >= weight[i])
                array[i][j] = max(array[i-1][j] , array[i-1][j-weight[i]] + value[i]);
            else
                array[i][j] = array[i-1][j];
        }
    }
    cout<<array[number][capacity]<<endl;
    return 0;
}