제출 #245553

#제출 시각아이디문제언어결과실행 시간메모리
245553zecookiezJust Long Neckties (JOI20_ho_t1)Pypy 2
0 / 100
27 ms4960 KiB
from sys import stdin
input = stdin.readline
gi = lambda: tuple(map(int, input().split()))
n = int(input())
arr = gi()
queries = sorted((i, j) for j, i in enumerate(arr))
brr = sorted(gi())
arr.sort()

suf = [0]
for i, val in enumerate(reversed(brr)):
    suf.append(max(suf[-1], max(arr[~i] - val, 0)))
ans = [0] * (n + 1)
for i, (val, ind) in enumerate(queries):
    if i == 0:
        ans[ind] = suf[-1]
        pre = max(val - brr[i], 0)
    elif i == n:
        ans[ind] = pre
    else:
        ans[ind] = max(pre, suf[~i])
        pre = max(pre, max(val - brr[i], 0))
print " ".join(map(str, ans))
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...