Submission #1000721

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
typedef long long ll;
ll mod=1e9+7;
int N,a[100000],b[100000];
int main(){
	cin>>N;
	rep(i,N) cin>>a[i];
	rep(i,N) cin>>b[i];
	sort(a,a+N);
	sort(b,b+N);
	ll ans=1;
	int j=0;
	rep(i,N-1){
		while(j!=N&&b[j]<a[i]) j++;
		ans=ans*(max(1,j-i))%mod;
	}
	j=0;
	rep(i,N-1){
		while(j!=N&&a[j]<b[i]) j++;
		ans=ans*(max(1,j-i))%mod;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result