简单01(Charm Bracelet)P3624

最新推荐文章于 2020-04-04 17:00:51 发布

原创最新推荐文章于 2020-04-04 17:00:51 发布 · 404 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#output #integer #list #ini #input

背包专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一个经典的背包问题求解案例，使用动态规划算法实现。通过输入不同物品的重量和价值，算法能够在限定的总重量下找到最大总价值的组合。

又一简单题，，一次过了，

#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<stack>
#include<math.h>
#include<stdlib.h>
#include<list>
#include<vector>

using namespace std;


int n,m;
int dp[1000000];
int val[10000];
int vol[10000];

int main()
{
    int i,j,k;
    while (cin>>n>>m)
    {
        for (i=0;i<n;i++)
            cin>>vol[i]>>val[i];
        for (i=0;i<=m;i++)
            dp[i]=0;
        for (i=0;i<n;i++)
        {
            for (j=m;j>=vol[i];j--)
            {
                dp[j]=max(dp[j],dp[j-vol[i]]+val[i]);
            }
        }
        cout<<dp[m]<<endl;
    }
}

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11719		Accepted: 5343

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 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