Submission #2013621

---

Source Code Expand

N = int(input())
a = [int(input()) for i in range(N)]
a.sort()
b = [int(input()) for i in range(N)]
b.sort()
MOD = 10**9+7

f = [1]
def factorial(n):
    while len(f) <= n:
        f.append((f[-1] * len(f)) % MOD)
    return f[n]

ans = 1
ai = bi = sec = 0
while ai + bi < 2*N:
    if ai == N:
        bi += 1
    elif bi == N:
        ai += 1
    elif a[ai] < b[bi]:
        ai += 1
    else:
        bi += 1
    if ai == bi:
        n = ai - sec
        ans = (ans * factorial(n)) % MOD
        sec = ai
print(ans)

Submission Info

Judge Result