POJ 3624 Charm Bracelet

最大化魅力：珠宝店魅力手链的魅力选择策略

最新推荐文章于 2019-08-06 15:11:09 发布

最新推荐文章于 2019-08-06 15:11:09 发布 · 127 阅读

本文探讨了如何在限定重量下，从众多魅力珠宝中选择最佳组合来最大化手链的魅力值。通过详细说明算法实现，提供了解决问题的策略，帮助读者在有限条件下做出最优选择。

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 charmiin 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:NandM
* Lines 2..N+1: Linei+1 describes charmiwith two space-separated integers:W_iandD_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

Sample Output

01背包详见背包九讲：http://blog.youkuaiyun.com/ultimater/article/details/7769429

LANGUAGE:C

CODE:

#include<stdio.h>
#define max(a,b) a>b?a:b
int main()
{
    //freopen("in.txt","r",stdin);
    int n,v,i,j,f[12900]={0},get[3405],cost[3405];
    scanf("%d%d",&n,&v);
    for(i=1;i<=n;i++)
        scanf("%d%d",&cost[i],&get[i]);
    for(i=1;i<=n;i++)
        for(j=v;j>=cost[i];j--)
            f[j]=max(f[j],f[j-cost[i]]+get[i]);
    printf("%d\n",f[v]);
    return 0;
}