0-1背包习题：Charm Bracelet S_bessie has gone to the mall's jewelry store and sp-CSDN博客

本文探讨了一位名叫Bessie的女孩如何在珠宝店中选择，利用背包算法解决在给定重量限制下，选取具有最高欲望值的N件饰品的问题。通过计算每个饰品的权重和价值，找到满足背包容量约束的最大价值总和。

题目描述
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 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.

有N件物品和一个容量为V的背包。第i件物品的重量是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且价值总和最大。

输入格式

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

第一行：物品个数N和背包大小M

第二行至第N+1行：第i个物品的重量C[i]和价值W[i]

输出格式

Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

输出一行最大价值。
输入输出样例
输入
4 6
1 4
2 6
3 12
2 7
输出
23

解析：在这里插入图片描述

#include "bits/stdc++.h"

using namespace std;
int w[4000]; // 重量
int v[4000];  //价值
int dp[12890]; //n个物品，容量为i时的最大价值
int main(){
    int n;
    cin >> n; 
    int W;
    cin >> W;

    for (int i = 0; i < n; i++){
        cin >> w[i] >> v[i];
    }
    for(int i = 0; i < n; i++){ 
        for (int j = W; j >= w[i]; j--){
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }
    cout << dp[W];

    return 0;
}