213922026-01-12 23:08:42algoproBányász RPG (40 pont)pypy3Runtime error 32/4090ms31056 KiB
# UUID: eb69efbc-f18d-4da8-9ccc-88c3cf9188e2
from array import array

def solvx():
    N = int(input())
    A = array('H', [int(x) for x in input().split()])
    B = array('H', [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
base32/40
1Accepted0/045ms19396 KiB
2Accepted0/068ms22772 KiB
3Accepted2/243ms19668 KiB
4Accepted2/243ms21128 KiB
5Accepted2/264ms22652 KiB
6Accepted2/274ms25600 KiB
7Accepted2/263ms21876 KiB
8Accepted2/254ms22136 KiB
9Accepted3/345ms19564 KiB
10Accepted3/343ms19468 KiB
11Accepted3/339ms19648 KiB
12Accepted3/343ms21280 KiB
13Accepted4/445ms21216 KiB
14Accepted4/450ms21172 KiB
15Runtime error0/285ms25984 KiB
16Runtime error0/279ms28972 KiB
17Runtime error0/274ms25832 KiB
18Runtime error0/290ms31056 KiB