213892026-01-12 23:05:00algoproBányász RPG (40 pont)pypy3Runtime error 36/40145ms32000 KiB
# UUID: dded1bc6-34e1-4ee0-b1ec-dd46349487b5
from array import array

def solvx():
    N = int(input())
    A = array('l', [int(x) for x in input().split()])
    B = array('l', [int(x) for x in input().split()])

    idx = list(range(N))
    idx.sort(key=lambda i: A[i])

    total_second = sum(B)
    ketpercesek = 0

    running_prefix = total_second

    for pos in range(N - 1, -1, -1):
        i = idx[pos]

        running_prefix -= B[i]

        if A[i] > ketpercesek + running_prefix:
            need = A[i] - (ketpercesek + running_prefix)
            if need < B[i]:
                ketpercesek += need
            else:
                ketpercesek += B[i]

    print(ketpercesek + total_second)

solvx()
SubtaskSumTestVerdictTimeMemory
base36/40
1Accepted0/039ms19884 KiB
2Accepted0/078ms22956 KiB
3Accepted2/243ms19680 KiB
4Accepted2/243ms21124 KiB
5Accepted2/264ms22864 KiB
6Accepted2/264ms26148 KiB
7Accepted2/252ms21972 KiB
8Accepted2/261ms22244 KiB
9Accepted3/346ms19436 KiB
10Accepted3/343ms19664 KiB
11Accepted3/339ms19424 KiB
12Accepted3/343ms21124 KiB
13Accepted4/452ms21120 KiB
14Accepted4/443ms21204 KiB
15Accepted2/2145ms28792 KiB
16Runtime error0/268ms32000 KiB
17Accepted2/2142ms29448 KiB
18Runtime error0/267ms32000 KiB