动态规划：0-1背包

def solve():
    weights = [____, ____, ____, ____]
    values = [____, ____, ____, ____]
    capacity = ____
    n = len(____)
    dp = [[____] * (____) for _ in range(____)]
    for i in range(____, n + ____):
        for w in range(____):
            dp[i][w] = dp[i-____][w]
            if weights[i-____] <= w:
                dp[i][w] = max(____)
    print(____)