213792026-01-12 22:36:14algoproBányász RPG (40 pont)pypy3Runtime error 0/4082ms32000 KiB
# UUID: cf50fbd0-4851-465a-889e-c85ece7d0a01


def solv():
    N = int(input())
    nums = list(map(int, input().split()))

    V = [(nums[i], nums[N + i]) for i in range(N)]

    V.sort()

    prefix = [0] * (N + 1)
    prefix[1] = V[0][1]
    for i in range(1, N):
        prefix[i + 1] = prefix[i] + V[i][1]

    ketpercesek = 0

    for i in range(N - 1, -1, -1):
        if V[i][0] > ketpercesek + prefix[i]:
            if ketpercesek + prefix[i] + V[i][1] > V[i][0]:
                ketpercesek += V[i][0] - (ketpercesek + prefix[i])
            else:
                ketpercesek += V[i][1]

    print(ketpercesek + prefix[N])


solv()
SubtaskSumTestVerdictTimeMemory
base0/40
1Runtime error0/072ms22708 KiB
2Runtime error0/070ms23312 KiB
3Runtime error0/272ms22696 KiB
4Runtime error0/265ms22464 KiB
5Runtime error0/268ms22248 KiB
6Runtime error0/281ms24808 KiB
7Runtime error0/267ms22544 KiB
8Runtime error0/274ms22500 KiB
9Runtime error0/375ms22756 KiB
10Runtime error0/365ms22752 KiB
11Runtime error0/371ms22756 KiB
12Runtime error0/364ms22408 KiB
13Runtime error0/474ms22360 KiB
14Runtime error0/474ms22568 KiB
15Runtime error0/279ms27876 KiB
16Runtime error0/281ms30252 KiB
17Runtime error0/276ms28408 KiB
18Runtime error0/282ms32000 KiB