每日三题-Day6-A(FZU 2214 Knapsack problem 01背包)
来源:互联网 发布:乔约翰逊生涯数据 编辑:程序博客网 时间:2024/06/08 14:47
Accept: 583 Submit: 2225Time 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;}
- 每日三题-Day6-A(FZU 2214 Knapsack problem 01背包)
- FZU 2214 Knapsack problem (01背包)
- FZU-2214-Knapsack problem【01背包】
- FZU 2214 Knapsack problem 01背包变形
- FZU 2214 Knapsack problem 01超大背包
- FZU 2214 Knapsack problem (超大容量背包)
- FZU 2214 Knapsack problem (0/1背包)
- FZU 2214 Knapsack problem
- FZU - 2214-Knapsack problem
- FZU 2214 Knapsack problem【DP】【超大容量背包】
- FZU Problem 2214 Knapsack problem(01背包,超大背包)——第六届福建省大学生程序设计竞赛-重现赛
- 背包问题(Knapsack problem)之01
- FOJ2214 Knapsack problem(逆01背包)
- FZOJ--2214--Knapsack problem(背包)
- FZU2214 Knapsack problem--01背包
- 2015福建省赛 fzoj Knapsack problem 2214 (01背包&转换)
- 0-1背包问题(knapsack problem)
- 背包问题(Knapsack problem) 之二
- java网络传输字符编码乱码解决
- 五一假第二天
- Farm Tour POJ
- 斗鱼弹幕助手授权验证相关
- Rectangles
- 每日三题-Day6-A(FZU 2214 Knapsack problem 01背包)
- Hibernate对象关系映射-- 多对多关联关系映射
- hdfs文件操作命令
- UGUI新手引导开发
- 同余定理
- I am new to Maven so please excuse any of my ignorance
- 三角形数字路径最大值问题
- 静态链表的实现
- java类加载机制