POJ3624 - Charm Bracelet(01背包)
2017-01-28 20:36
483 查看
Charm Bracelet
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 36471 Accepted: 15980
Description
Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a ‘desirability’ factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
Input
Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
Output
Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
Sample Input
4 6
1 4
2 6
3 12
2 7
Sample Output
23
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 36471 Accepted: 15980
Description
Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a ‘desirability’ factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
Input
Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
Output
Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
Sample Input
4 6
1 4
2 6
3 12
2 7
Sample Output
23
#include<cstdio> #include<iostream> #include<string.h> #include<stdlib.h> #include<algorithm> #include<math.h> using namespace std; int dp[12881]; int c[3405]; int w[3405]; int main(){ int n,V; scanf("%d%d",&n,&V); for(int i=1;i<=n;i++) scanf("%d%d",&c[i],&w[i]) ; for(int i=1;i<=n;i++) for(int j=V;j>=c[i];j--) dp[j]=max(dp[j],dp[j-c[i]]+w[i]); cout<<dp[V]<<endl; }
相关文章推荐
- poj 3624 Charm Bracelet (01背包模板)
- POJ 3624 Charm Bracelet 01背包问题
- POJ 3624 Charm Bracelet - 01背包-详解
- POJ 3624 Charm Bracelet(01背包)
- POJ 题目3624 Charm Bracelet(动态规划 01背包)
- POJ 3624 Charm Bracelet(01背包问题)
- POJ Problem 3624 Charm Bracelet 【01背包】
- POJ_3624Charm Bracelet(01背包)
- POJ 3624 Charm Bracelet【01背包入门题】
- POJ 3624 Charm Bracelet(01背包 基础)
- POJ 3624 Charm Bracelet (01背包)
- POJ - 3624 Charm Bracelet (01背包)
- poj 3624 Charm Bracelet(01背包)
- POJ 3624 Charm Bracelet(经典的01背包问题)
- poj 3624Charm Bracelet(简单01背包)
- POJ_3624Charm Bracelet(01背包)
- POJ3624 Charm Bracelet(01背包问题)
- POJ 3624 Charm Bracelet (01背包)
- 【POJ-3624】Charm Bracelet (01背包)
- 【POJ】3624 - Charm Bracelet(01背包)