0052.携带研究材料II.md

52. 携带研究材料

题目链接

C++

#include <iostream>
#include <vector>
using namespace std;

// 先遍历背包，再遍历物品
void test_CompletePack(vector<int> weight, vector<int> value, int bagWeight) {
    
    vector<int> dp(bagWeight + 1, 0);

    for(int j = 0; j <= bagWeight; j++) { // 遍历背包容量
        for(int i = 0; i < weight.size(); i++) { // 遍历物品
            if (j - weight[i] >= 0) dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }
    cout << dp[bagWeight] << endl;
}
int main() {
    int N, V;
    cin >> N >> V;
    vector<int> weight;
    vector<int> value;
    for (int i = 0; i < N; i++) {
        int w;
        int v;
        cin >> w >> v;
        weight.push_back(w);
        value.push_back(v);
    }
    test_CompletePack(weight, value, V);
    return 0;
}

Java

import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt(), V = sc.nextInt();
        int[] weights = new int[N], vals = new int[N];
        for (int i = 0; i < N; i++) {
            weights[i] = sc.nextInt();
            vals[i] = sc.nextInt();
        }
        helper(weights, vals, V);
        sc.close();
    }

    static void helper(int[] weights, int[] vals, int bagSize) {
        int[] dp = new int[bagSize + 1];

        for (int j = 0; j <= bagSize; j++) { // 遍历背包
            for (int i = 0; i < weights.length; i++) { // 遍历物品
                if (j >= weights[i])
                    dp[j] = Math.max(dp[j], dp[j - weights[i]] + vals[i]);
            }
        }

        System.out.println(dp[bagSize]);
    }
}

Python

from sys import stdin
N, V = map(int, input().split())
arr = [tuple(map(int, line.split())) for line in stdin]
arr.sort()

dp = [0]*(V+1)
for w, v in arr:
    for j in range(w, V+1):
        dp[j] = max(dp[j], dp[j-w] + v)
print(dp[-1])

Go

JS

C