编辑代码

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

    for i in range(1, n + 1):
        for j in range(1, capacity + 1):
            weight, value = weights[i - 1], values[i - 1]

            if j >= weight:
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight] + value)
            else:
                dp[i][j] = dp[i - 1][j]

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

    selected_items.reverse()
    return dp[n][capacity], selected_items

def main():
    capacity = 20
    items = ["苹果", "香蕉", "橘子", "猕猴桃"]
    weights = [15, 18, 10, 9]
    values = [300, 180, 150, 270]

    total_value, selected_items = knapsack_problem(capacity, weights, values, items)

    print(f"在背包承重为{capacity}kg的情况下，可以获得的最大总价值为: {total_value}")
    print(f"选择的水果为: {', '.join(selected_items)}")

if __name__ == "__main__":
    main()