FOJ2214 Knapsack problem（逆01背包）

Link：http://acm.fzu.edu.cn/problem.php?pid=2214

Problem 2214 Knapsack problem

Accept: 742    Submit: 2812
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

15 1512 42 21 14 101 2

 Sample Output

15

 Source

第六届福建省大学生程序设计竞赛-重现赛（感谢承办方华侨大学）

AC code：

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<vector>
#define LL long long
#define INF 0xffffffff
#define PI acos(-1)
#define EPS 1e-6
using namespace std;

int n;

//逆01背包公式：dp[v]=min(dp[v],dp[v-val[i]]+wei[i]); 
LL B,sum;
LL wei[555],val[555],dp[5050];

int main()
{
//	freopen("in.txt","r",stdin);
	int t,i,j;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%lld",&n,&B);
		sum=0;
		for(i=1;i<=n;i++)
		{
			scanf("%lld %lld",&wei[i],&val[i]);
			sum+=val[i];
		}
		for(i=0;i<=sum;i++)
		{
			dp[i]=INF;
		}
		dp[0]=0;
		for(i=1;i<=n;i++)
		{
			for(j=sum;j>=val[i];j--)
			{
				dp[j]=min(dp[j],dp[j-val[i]]+wei[i]);
			}
		}
		for(i=sum;i>=0;i--)
		{
			if(dp[i]<=B)
			{
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}