编辑代码

def fruits1(weights, values, capacity):
    n = len(weights)
    d = [[0] * (capacity + 1) for _ in range(n + 1)]
    for i in range(1, n + 1):
        for j in range(capacity + 1):
            if weights[i - 1] <= j:
                d[i][j] = max(d[i - 1][j], d[i - 1][j - weights[i - 1]] + values[i - 1])
            else:
                d[i][j] = d[i - 1][j]
    items = []
    i, j = n, capacity
    while i > 0 and j > 0:
        if d[i][j] != d[i - 1][j]:
            items.append((i - 1, weights[i - 1], values[i - 1]))
            j -= weights[i - 1]
        i -= 1
    return d[n][capacity], items


def print_strategy(total_value, selected_items, fruits):
    print(f"总价值: {total_value} 元")
    print("装水果策略:")
    for item in selected_items:
        index, weight, value = item
        print(f"装入 {weight}kg 的 {fruits[index]}，价值 {value} 元")


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


main()