Submission #2591831

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

using i64 = long long int;

const i64 MOD = 1e9 + 7;

i64 fact[100005] = {0};

void factorial(i64 n){
    fact[1] = 1;
    for(int i=2;i<=n;++i)fact[i] = i * fact[i-1] % MOD;
}

int main(){
    int n;
    cin >> n;
    vector<pair<i64, int>> v;
    for(int i=0;i<n;++i){
        i64 a;
        cin >> a;
        v.emplace_back(a, 1);
    }
    for(int i=0;i<n;++i){
        i64 b;
        cin >> b;
        v.emplace_back(b, -1);
    }

    sort(v.begin(), v.end());

    i64 maxi = 0, acc = 0;
    for(auto e : v){
        acc += e.second;
        maxi = max(maxi, abs(acc));
    }

    factorial(maxi);

    cout << fact[maxi] << endl;

    return 0;
}

Submission Info

Judge Result