题目:
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
这个题就是01背包的问题,下面代码直接用了一维数组来储存:
#include<stdio.h>
int W[3500];
int D[3500];
int f[13000];
int main(){
int ans,max,n,i,j;
scanf("%d",&n);
scanf("%d",&max);
for(i=0;i<n;i++){
scanf("%d",&W[i]);
scanf("%d",&D[i]);
}
for(i=0;i<n;i++){
for(j=max;j>0;j--){
if(j>=W[i]&&f[j]<f[j-W[i]]+D[i])
f[j]=f[j-W[i]]+D[i];
}
}
ans=0;
for(i=0;i<=max;i++){
if(f[i]>ans)
ans=f[i];
}
printf("%d\n",ans);
return 0;
}