hdoj2602_Bone Collector（dp）

思路：01背包

#include<iostream>
#include<string.h>
#include<algorithm>

using namespace std;

int val[1001], wei[1001], table[1001];

int dp(int n,int w)
{
    memset(table, 0, sizeof(table));
    for (int i = 0; i < n; i++)
    {
        for (int j = w; j >=wei[i]; j--)
        {
            table[j] = max(table[j], table[j - wei[i]] + val[i]);
        }
    }
    int ans = 0;
    for (int i = 0; i <= w; i++)
        ans = max(table[i], ans);
    return ans;
}

int main()
{
    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
    {
        int n, w;
        cin >> n >> w;
        for (int j = 0; j < n; j++)
            cin >> val[j];
        for (int j = 0; j < n; j++)
            cin >> wei[j];
        cout << dp(n,w) << endl;
    }
    return 0;
}