Accept: 583 Submit: 2225
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
Sample Output
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long dp[5005];
int w[505];
int v[505];
int main()
{
int n,t;
int q;
scanf("%d",&t);
while(t--)
{
int sum=0;
scanf("%d%d",&n,&q);
for(int i=0;i<n;i++)
{
scanf("%d%d",&w[i],&v[i]);
sum+=v[i];
}
memset(dp,0x3f3f3f,sizeof(dp));
dp[0]=0;
for(int i=0;i<n;i++)
{
for(int j=sum;j>=v[i];j--)
{
dp[j]=min(dp[j],dp[j-v[i]]+w[i]);
}
}
int ans=0;
for(int i=sum;i>=0;i--)
{
ans=i;
if(dp[i]<=q)break;
}
printf("%d\n",ans);
}
return 0;
}