Submission #63516209

---

Source Code Expand

import functools

def read():
    return int(input())

def reads():
    return [int(s) for s in input().split()]


def solve():
    n, m = reads()
    b = sorted(reads())[::-1]
    w = sorted(reads())[::-1]

    sb = 0
    for i, bi in enumerate(b + [0]):
        if bi < 0:
            break
        sb += bi

    ans = max(0, sb)
    sw = 0
    for j, wj in enumerate(w):
        if j == i:
            if i >= len(b):
                break
            sb += b[i]
            i += 1
        sw += wj
        ans = max(ans, sb + sw)

    print(ans)
    

if __name__ == '__main__':
    solve()

Submission Info

Judge Result