Submission #1908481

---

Source Code Expand

#include <cmath>
#include <stack>
#include <iostream>
#include <algorithm>
using namespace std;
int n, a[100009], b[100009], p[200009];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < n; i++) cin >> b[i];
	for (int i = 0; i < 2 * n; i++) p[i] = i;
	sort(p, p + 2 * n, [](int v1, int v2) { return (v1 < n ? a[v1] : b[v1 - n]) < (v2 < n ? a[v2] : b[v2 - n]); });
	int d = 0, ret = 1;
	for (int i = 0; i < 2 * n; i++) {
		int nd = d + (p[i] < n ? 1 : -1);
		if (abs(d) > abs(nd)) ret = 1LL * ret * abs(d) % 1000000007;
		d = nd;
	}
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result