找啊找啊找GF

def solve(____):
    n = len(rmb.split(____))
    rmb = list(map(int, rmb.split(____)))
    rp = list(map(int, rp.split(____)))
    time_list = list(map(int, time_list.split(____)))
    dp = [[[____, ____] for _ in range(____)] for _ in range(____)]
    for i in range(____):
        for j in range(____):
            for k in range(____, rp[i] - ____, -____):
                if dp[j - rmb[i]][k - rp[i]][____] + ____ > dp[j][k][____]:
                    dp[j][k][____] = dp[j - rmb[i]][k - rp[i]][____] + ____
                    dp[j][k][____] = dp[j - rmb[i]][k - rp[i]][____] + time_list[i]
    print(____)