FZU 2214 Knapsack problem 01超大背包

Problem 2214 Knapsack problem

Time Limit: 3000 mSec    Memory Limit : 32768 KB

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
1
5 15
12 4
2 2
1 1
4 10

1 2

Sample Output

15

    一道典型的01背包题，而区别在于，这道题容量的最大范围达到了1000000000，所以如果用常规的01背包的做法是不行的，存容量的数组存不了那么大，而且就算存的下，数据太大也会出现TLE的情况。不过，这题提到了1 <= v[1]+v[2]+...+v[n] <= 5000，这个数据还不算大，所以，这道题可以倒过来去想。将价值和容量的数组调换，求出在n价值的情况下所需的最小容量，最后再跑一个循环查找第一个合适的容量，输出此时的价值就可以了。

    需要注意的是因为倒过来计算了，所以查找的不是max而是min，f数组也要初始化为最大值，f[0]=0。

    下面AC代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int f[5005];
int w[5005];
int v[5005];

int min(int a,int b)
{
    return a<b?a:b;
}
int main()
{
    int kase;
    scanf("%d",&kase);
    while(kase--)
    {
        memset(w,0,sizeof(w));
        memset(v,0,sizeof(v));
        int n;
        int b;
        int V=0;
        scanf("%d%d",&n,&b);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&w[i],&v[i]);
            V+=v[i];
        }
        f[0]=0;
        for(int i=1;i<=V;i++)
        {
            f[i]=1000000000;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=V;j-v[i]>=0;j--)
            {
                f[j]=min(f[j],f[j-v[i]]+w[i]);
            }
        }
        for(int i=V;i>=0;i--)
        {
            if(f[i]<=b)
            {
                cout<<i<<endl;
                break;
            }
        }
    }
    return 0;
}