FZU - 2214-Knapsack problem

Description

Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less than or equal to a given limit B and the total value is as large as possible. Find the maximum total value. (Note that each item can be only chosen once).

Input

The first line contains the integer T indicating to the number of test cases.

For each test case, the first line contains the integers n and B.

Following n lines provide the information of each item.

The i-th line contains the weight w[i] and the value v[i] of the i-th item respectively.

1 <= number of test cases <= 100

1 <= n <= 500

1 <= B, w[i] <= 1000000000

1 <= v[1]+v[2]+...+v[n] <= 5000

All the inputs are integers.

Output

For each test case, output the maximum value.

Sample Input

15 1512 42 21 14 101 2

Sample Output

15

质量dp会越界，用价值。

源代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
long long thing[5500];
int w[550],v[550];
int main()
{
    int t,n,B;
    scanf("%d", &t);
    while(t--)
    {
        int sum = 0;
        scanf("%d%d", &n,&B);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d%d", &w[i], &v[i]);
            sum += v[i];
        }
        memset(thing, INF, sizeof(thing));
        thing[0] = 0;
        for(int i = 1; i <= n; i++)
        {
            for(int j = sum; j >= v[i]; j--)
            {
                if(thing[j - v[i]] != INF)
                    thing[j] = min(thing[j], thing[j - v[i]] + w[i]);
            }
        }
        for(int i = sum; i >= 0; i--)
        {
            if(thing[i] <= B)
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}