Submission #22,693

2026-01-15 16:20:36

python3

Accepted 40/40

263ms

22852 KiB

n = int(input())
lvls = list(map(int, input().split()))
needed = list(map(int, input().split()))
if lvls != [lvls[0] for _ in range(n)]:
    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
else:
    time = 2 * lvls[0] + sum(needed) - lvls[0]

print(time)

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	16ms	3312 KiB
		2	Accepted	0/0	50ms	6612 KiB
		3	Accepted	2/2	16ms	3124 KiB
		4	Accepted	2/2	17ms	3124 KiB
		5	Accepted	2/2	25ms	5236 KiB
		6	Accepted	2/2	32ms	6992 KiB
		7	Accepted	2/2	17ms	3636 KiB
		8	Accepted	2/2	18ms	3884 KiB
		9	Accepted	3/3	16ms	3140 KiB
		10	Accepted	3/3	16ms	3124 KiB
		11	Accepted	3/3	16ms	3136 KiB
		12	Accepted	3/3	16ms	3124 KiB
		13	Accepted	4/4	17ms	3136 KiB
		14	Accepted	4/4	16ms	3212 KiB
		15	Accepted	2/2	144ms	13996 KiB
		16	Accepted	2/2	182ms	18108 KiB
		17	Accepted	2/2	148ms	14856 KiB
		18	Accepted	2/2	263ms	22852 KiB