Submission #22,690

2026-01-15 16:12:41

python3

Accepted 40/40

280ms

22936 KiB

n = int(input())
lvls = list(map(int, input().split()))
needed = list(map(int, input().split()))
lvls, needed = zip(*sorted(zip(lvls, needed)))
lvls, needed = list(lvls), list(needed)
lvl = 0
time = 0

l = 0
r = n - 1

while l <= r:
    if lvls[l] <= lvl:
        time += needed[l]
        lvl += needed[l]
        l += 1
    else:
        if needed[r] >= lvls[l] - lvl:
             num = lvls[l] - lvl
        else:
            num = needed[r]
        lvl += num
        time += 2*num
        needed[r] -= num
        if needed[r] == 0:
            r -= 1

print(time)

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	16ms	3124 KiB
		2	Accepted	0/0	48ms	6544 KiB
		3	Accepted	2/2	16ms	3120 KiB
		4	Accepted	2/2	17ms	3236 KiB
		5	Accepted	2/2	45ms	5940 KiB
		6	Accepted	2/2	76ms	9036 KiB
		7	Accepted	2/2	21ms	3760 KiB
		8	Accepted	2/2	27ms	4000 KiB
		9	Accepted	3/3	16ms	3116 KiB
		10	Accepted	3/3	17ms	3124 KiB
		11	Accepted	3/3	16ms	3084 KiB
		12	Accepted	3/3	17ms	3204 KiB
		13	Accepted	4/4	17ms	3208 KiB
		14	Accepted	4/4	17ms	3220 KiB
		15	Accepted	2/2	128ms	13792 KiB
		16	Accepted	2/2	212ms	18244 KiB
		17	Accepted	2/2	140ms	14968 KiB
		18	Accepted	2/2	280ms	22936 KiB