213802026-01-12 22:36:57algoproBányász RPG (40 pont)pypy3Runtime error 32/40133ms32000 KiB
# UUID: ab4d70b1-4f9e-4c64-ac96-22277af08cd0


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

    V = [(nums[i], nums2[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
base32/40
1Accepted0/039ms19436 KiB
2Accepted0/093ms23584 KiB
3Accepted2/243ms19592 KiB
4Accepted2/246ms21476 KiB
5Accepted2/289ms23268 KiB
6Accepted2/2133ms26076 KiB
7Accepted2/264ms21964 KiB
8Accepted2/261ms22236 KiB
9Accepted3/346ms19436 KiB
10Accepted3/346ms19564 KiB
11Accepted3/346ms19440 KiB
12Accepted3/350ms21156 KiB
13Accepted4/454ms21360 KiB
14Accepted4/443ms21144 KiB
15Runtime error0/275ms32000 KiB
16Runtime error0/264ms32000 KiB
17Runtime error0/264ms32000 KiB
18Runtime error0/279ms32000 KiB