Submission #4572560

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ll N,ans=1,a,MOD=1e9+7,i;
	cin >> N;
	priority_queue<pair<ll,ll>> Q;
	for(i=0;i<N;i++)cin>>a,Q.push({-a,-1});
	for(i=0;i<N;i++)cin>>a,Q.push({-a,1});
	a = 0;
	while(!Q.empty()){
		i=Q.top().second;
		if(a!=i*llabs(a))
			(ans*=llabs(a))%=MOD;
		a+=i;Q.pop();
	}
	cout << ans << endl;
}

Submission Info

Judge Result