Submission #2823632

---

Source Code Expand

#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
ll int MOD=1e9+7;
#define INF 2*1e9
#define N 310000
 
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");

main(){
    int n;
    cin>>n;
    vector<pii> v;
    rep(i,n){
        int a;cin>>a;
        v.pb({a,0});
    }
    rep(i,n){
        int a;cin>>a;
        v.pb({a,1});
    }
    sort(v.begin(),v.end());
    int t=0,s;
    ll ans=1;
    rep(i,2*n){
        s=v[i].second;t=1;
        while(t){
            i++;
            if(v[i].second==s){
                t++;
            }
            else{
                ans=ans*t%MOD;
                t--;
            }
        }
    }
    cout<<ans;
}

Submission Info

Judge Result