Knapsack problem

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

1
5 15
12 4
2 2
1 1
4 10
1 2

Sample Output

15

题意：给N个物品，和N个物品的重量与权值，给一个重量有限的包裹，问怎么才能获得

包裹内物品的最大价值。

思路：0—1背包，给出每个价值下的总量和最小，依次更新，找到最接近包裹极限但又不

超过包裹极限下的最有价值。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f
using namespace std;
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&m);
        int w[n+1],v[n+1],val=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d %d",&w[i],&v[i]);
            val+=v[i];
        }
        int dp[val+1];
        memset(dp,INF,sizeof(dp));
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=val;j>=v[i];j--)
            {
                if(dp[j]>dp[j-v[i]]+w[i])
                    dp[j]=dp[j-v[i]]+w[i];
            }
        }
        int i;
        for( i=val;i>=0;i--)
        {
            if(dp[i]<=m)
                break;
        }
        printf("%d\n",i);
    }
    return 0;
}