D - Charm Bracelet 背包问题

 

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3624

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 W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 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: W_i and D_i

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

 Home    Problems    Status    Contest    [xiong_tao]    Logout
 xiong_tao 's source code for D
 Memory:  KB         Time:  MS
 Language: G++         Result: Accepted

 #include<cstdio>
 #include<string.h>
 using namespace std;
 int dp[],w[],d[];
 int n,m;
 int main()
 {
     int i,j;
     while(scanf("%d%d",&n,&m)!=EOF)
     {
         for(i=;i<n;i++)
             scanf("%d%d",&w[i],&d[i]);
         memset(dp,,sizeof(dp));
         for(i=;i<n;i++)
             for(j=m;j>=;j--)
                if(j>=w[i])
                dp[j]=dp[j]>dp[j-w[i]]+d[i]?dp[j]:dp[j-w[i]]+d[i];
         printf("%d\n",dp[m]);
     }
     return ;
 }

 FAQ | About Virtual Judge | Forum | Discuss | Open Source Project
 All Copyright Reserved ©- HUST ACM/ICPC TEAM
 Anything about the OJ, please ask in the forum, or contact author:Isun
 Server Time: -- ::