Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 22651 | Accepted: 10177 |
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
/*此程序采用一维数组dp[i]表示重量为i的时候得到的最大价值
之所以不用二维数组是因为空间超出,因为如果以二维dp[i][j]表示当前第i个物品在不超过j重量的背包里的物品的最大价值,则要开出dp[3402][400]大小的空间*/
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int maxn=13000;
int dp[maxn];
int w[3410],d[3410];
int n,m,i,j,k;
int main()
{
cin>>n>>m;//n是物品的个数,m是背包重量的上限
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{scanf("%d%d",&w[i],&d[i]);}
for(i=1;i<=n;i++)
for(j=m;j>=w[i];j--)//这是逆着推的,结果是正确的
//for(j=w[i];j<=m;j++)这是正着推的,结果是错误的
if(dp[j-w[i]]+d[i]>dp[j])
{dp[j]= dp[j-w[i]]+d[i];}
printf("%d\n",dp[m]);
return 0;
}