洛谷 python P2392 kkksc03考前临时抱佛脚

def f(ns, half):
    dp = [0] * (half + 1)
    for i in ns:
        for j in range(half, i - 1, -1):
            dp[j] = max(dp[j - i] + i, dp[j])
    return dp[-1]

def main():
    n = list(map(int, input().split()))
    m = len(n)
    res = 0
    for i in range(m):
        temp = list(map(int, input().split()))
        tempSum = sum(temp)
        halfOne = f(temp, tempSum // 2)
        halfTwo = tempSum - halfOne
        res += halfTwo
    print(res)
    
main()