Submission #1000582

---

Source Code Expand

#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstring>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define F0(i,n) for (int i = 0; i < n; i++)
#define F1(i,n) for (int i = 1; i <= n; i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define SZ(x) ((int)x.size())
const double eps = 1e-10;
const int MOD = 1000000007;
int i, j, k, m, n, l;
ll ans;

int main() {
	//freopen("x.in", "r", stdin);
	cin >> n;
	vector<pii> v;
	F0(i, n) {
		cin >> j;
		v.push_back(pii(j, -1));
	}
	F0(i, n) {
		cin >> j;
		v.push_back(pii(j, 1));
	}
	sort(v.begin(), v.end());
	ans = 1;
	int b = 0;
	for (pii p : v) {
		if (p.second == 1) {
			if (b >= 0) b++; else {
				ans = ans * abs(b) % MOD;
				b++;
			}
		}
		else {
			if (b <= 0) b--; else {
				ans = ans * abs(b) % MOD;
				b--;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result