Submission #2702403

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class A, size_t N, class T> void Fill(A (&a)[N], const T &v){ fill( (T*)a, (T*)(a+N), v ); }

const ll MOD = 1e9+7;


int main(){
	ios_base::sync_with_stdio(false);
	int N;
	int a[100005], b[100005];
	vector<pii> v;

	cin >> N;
	rep(i,N) cin >> a[i], v.emplace_back(a[i], 1);
	rep(i,N) cin >> b[i], v.emplace_back(b[i], -1);

	sort(all(v));

	ll ans = 1, cur = 0;
	for(auto p: v){
		if( cur * p.Y < 0 ) ans = (ans * abs(cur)) % MOD;
		cur += p.Y;
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result