Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 35966 | Accepted: 15775 |
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
Source
题目分析:这题貌似只能用一维的数组,如果二维的话3402*12880的数组貌似是开不了的。简单01背包,请看代码。
代码如下:
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxx=3402+10;
int dp[12880+50],val[maxx],wei[maxx];
int N,M;
int main(){
while(cin>>N>>M)
{
memset(dp,0,sizeof(dp));
for(int i=0;i<N;i++)
cin>>wei[i]>>val[i];
for(int i=0;i<N;i++)
{
for(int j=M;j>=wei[i];j--)
{
dp[j]=max(dp[j],dp[j-wei[i]]+val[i]);
}
}
cout<<dp[M]<<endl;
}
return 0;}