1034: [ZJOI2008]泡泡堂BNB

知道原本可以不用写的这么麻烦
懒得想了
容易想到优先匹配 胜利 的，
然后 再去 匹配平局
然后就是二分一下然后并查集搞搞就行了
对于 最小 得分
就是对手最大得分， 反过来对对手处理一遍即可
c++ 代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1; x = 0;
    do { c = getchar(); if(c == '-') sign = -1;}while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 1e5 + 20;
int p[N],n,a[N],b[N];

int get_fa(int x) { return p[x] == x ? x : p[x] = get_fa(p[x]); }

inline int find2(int x)
{
    int ans = 0;
    int l = 1,r = n,mid;
    while(l <= r)
    {
        if(b[mid = l + r >> 1] <= x) ans = mid,l = mid + 1;
        else r = mid - 1;
    }
    return ans;
}
inline int find(int x)
{
    int ans = 0;
    int l = 1,r = n,mid;
    while(l <= r)
    {
        if(b[mid = l + r >> 1] < x) ans = mid,l = mid + 1;
        else r = mid - 1;
    }
    return ans;
}

inline int Find2(int x)
{
    int ans = 0;
    int l = 1,r = n,mid;
    while(l <= r)
    {
        if(a[mid = l + r >> 1] <= x) ans = mid,l = mid + 1;
        else r = mid - 1;
    }
    return ans;
}
inline int Find(int x)
{
    int ans = 0;
    int l = 1,r = n,mid;
    while(l <= r)
    {
        if(a[mid = l + r >> 1] < x) ans = mid,l = mid + 1;
        else r = mid - 1;
    }
    return ans;
}

int Link[N];
int main()
{
    read(n);
    rep(i,1,n) read(a[i]);
    rep(i,1,n) read(b[i]);
    sort(a + 1,a + 1 + n);
    sort(b + 1,b + 1 + n);
    rep(i,0,n + 1) p[i] = i;
    int ans = 0;
    rep(i,1,n)
    {
        int x = find(a[i]);
        x = get_fa(x);
        if(x == 0) continue;
        Link[i] = 1;
        ans += 2 , p[x] = x - 1;
    }
    rep(i,1,n) if(Link[i]) continue;
    else
    {
        int x = find2(a[i]);
        x = get_fa(x);
        if(x == 0) continue;
        ans ++,p[x] = x - 1;
    }
    cout << ans << ' '; ans = 0;
    rep(i,0,n + 1) p[i] = i;
    memset(Link,0,sizeof Link);
    rep(i,1,n)
    {
        int x = Find(b[i]);
        x = get_fa(x);
        if(x == 0) continue;
        Link[i] = 1; p[x] = x - 1;
    }
    rep(i,1,n) if(Link[i]) continue;
    else
    {
        int x = Find2(b[i]);
        x = get_fa(x);
        if(x == 0){ ans += 2; continue; }
        ans ++; p[x] = x - 1;
    }
    cout << ans << endl;
    return 0;
}