POJ 3624 Charm Bracelet

点击打开链接

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 15711		Accepted: 7146

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 theN (1 ≤N ≤ 3,402) available charms. Each charm i in the supplied list has a weightW_i (1 ≤W_i ≤ 400), a 'desirability' factorD_i (1 ≤D_i ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more thanM (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 andD_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

Source

USACO 2007 December Silver

#include<stdio.h>
#include<string.h>
int dp[20007];
struct sa
{
    int w,d;
}data[20007];
int max(int a,int b)
{
    return a>b?a:b;
}
int main()
{
    int n,m,i,j;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    scanf("%d%d",&data[i].w,&data[i].d);
    memset(dp,0,sizeof(dp));
    for(i=1;i<=n;i++)
    for(j=m;j>=data[i].w;j--)
    dp[j]=max(dp[j],dp[j-data[i].w]+data[i].d);
    printf("%d\n",dp[m]);
    return 0;
}