| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1315846 | vikgup | Just Long Neckties (JOI20_ho_t1) | C++20 | 0 ms | 0 KiB |
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
pref = [0] * (n + 1)
for i in range(1, n + 1):
pref[i] = max(pref[i - 1], max(a[i - 1] - b[i - 1], 0))
suf = [0] * (n + 2)
for i in range(n - 1, -1, -1):
suf[i] = max(suf[i + 1], max(a[i + 1] - b[i], 0))
ans = []
for k in range(n + 1):
ans.append(max(pref[k], suf[k]))
print(*ans)
