Submission #3286298

---

Source Code Expand

n = gets.to_i
a = (n.times.map{[gets.to_i,0]}+n.times.map{[gets.to_i,1]}).sort_by{|i,j|i}
ans = 1
mod = 10**9+7
s = [0,0]

for i in 0..2*n-1
  if s[1^a[i][1]] == 0
    s[a[i][1]] += 1
  else
    ans *= s[1^a[i][1]]
    ans %= mod
    s[1^a[i][1]] -= 1
  end
end

puts ans

Submission Info

Judge Result