Submission #1000574

---

Source Code Expand

#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long LL;

int main(){
	int n;
	cin >> n;
	pair<int,int> s[2*n];
	for(int i = 0; i < n; i++){
		cin >> s[i].first;
		s[i].second = -1;
	}
	for(int i = 0; i < n; i++){
		cin >> s[i+n].first;
		s[i+n].second = 1;
	}
	sort(s,s+2*n);
	LL ans = 1;
	LL cur = 0;
	for(int i = 0; i < 2*n; i++){
		if(abs(cur+s[i].second) < abs(cur)){
			ans *= cur;
			ans %= MOD;
		}
		cur += s[i].second;
	}
	cout << ans << endl;


}

Submission Info

Judge Result