Submission #3747606

---

Source Code Expand

#include <bits/stdc++.h>
#define maxn 200005
#define oo 1e9+5
#define foru(a,b,c) for (int a=b;a<=c;a++)
#define ford(a,b,c) for (int a=b;a>=c;a--)
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define ll long long
#define forv(a,b) for(auto&a:b)
#define base 1000000007
using namespace std;
struct data
{
    int x,t;
};
bool cmp(data p1,data p2)
{
    return p1.x<p2.x;
}
int n;
data a[maxn];
int main()
{
    ios_base::sync_with_stdio(0);
    //freopen("connect.inp", "r", stdin);
    //freopen("connect.out", "w", stdout);
    cin >> n;
    foru(i,1,n)
    {
        cin >> a[i].x;
        a[i].t=1;
    }
    foru(i,n+1,2*n)
    {
        cin >> a[i].x;
        a[i].t=2;
    }
    sort(a+1,a+2*n+1,cmp);
    multiset<int> h1,h2;
    ll kq=1;
    foru(i,1,2*n)
    {
        if (a[i].t==1)
        {
            if (h2.size()==0) h1.insert(a[i].x);
            else
            {
                kq=(kq*h2.size())%base;
                h2.erase(h2.begin());
            }
        }
        else
        {
            if (h1.size()==0) h2.insert(a[i].x);
            else
            {
                kq=(kq*h1.size())%base;
                h1.erase(h1.begin());
            }
        }
    }
    cout << kq;
}

Submission Info

Judge Result