1586. 【吴永辉】程序设计基础实践7-9

1586. 【吴永辉】程序设计基础实践7-9

M. Charm Bracelet
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≤3402) 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
A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

Samples
Input
4 6
1 4
2 6
3 12
2 7
Output
23
————————————————————————————————————————
标准的01背包问题

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
priority_queue<int,vector<int>,greater<int> >qq;
priority_queue<int,vector<int>,less<int> >pp;
int w[4000],v[4000];
int dp[30000];
int main() {
    std::ios::sync_with_stdio(false);
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>w[i]>>v[i];
        }
        for(int i=1;i<=n;i++){
            for(int j=m;j>=w[i];j--){
                dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
            }
        }
        cout<<dp[m];
	return 0;
}