제출 #245554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245554		zecookiez	Just Long Neckties (JOI20_ho_t1)	Pypy 2	100 / 100	994 ms	57376 KiB

ho_t1

from sys import stdin
input = stdin.readline
gi = lambda: 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))

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91