1009 B | 1009 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
SYS_INPUT = False
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "
if SET_RECURSION:
sys.setrecursionlimit(RECURSION_LIMIT)
inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n = ii()
ar = mii()
B = sorted(mii())
l = [[ar[idx], idx] for idx in range(n)]
l.sort(key = lambda t : t[0])
ans = [0] * n
for i in range(n):
if l[i][0] > B[i]:
p(-1)
return
ans[l[i][1]] = B[i]
p(*ans)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()