递归背包问题

def solve(____):
    capacity = int(____)
    weights = list(map(int, str(____).split(____)))
    values = list(map(int, str(____).split(____)))
    n = len(____)
    dp = [____] * (____)
    for i in range(____):
        for w in range(____):
            dp[w] = max(____)
    print(____)