编辑代码

def knapsack_fruits(weights, values, capacity):
    n = len(weights)
    dp = [[0] * (capacity + 1) for _ in range(n + 1)]

    for i in range(1, n + 1):
        for w in range(1, capacity + 1):
            if weights[i - 1] <= w:
                dp[i][w] = max(dp[i - 1][w], values[i - 1] + dp[i - 1][w - weights[i - 1]])
            else:
                dp[i][w] = dp[i - 1][w]

    selected_fruits = []
    i, j = n, capacity
    while i > 0 and j > 0:
        if dp[i][j] != dp[i - 1][j]:
            selected_fruits.append(i - 1)
            j -= weights[i - 1]
        i -= 1

    return selected_fruits, dp[n][capacity]

# 给定数据
fruits = ["苹果", "香蕉", "橘子", "猕猴桃"]
weights = [15, 18, 10, 9]
values = [300, 180, 150, 270]
capacity = 20

# 解决背包问题
selected, max_value = knapsack_fruits(weights, values, capacity)

# 打印结果
print("选中的水果:")
for index in selected:
    print(fruits[index])

print("最大总价值:", max_value)