bzoj1034: [ZJOI2008]泡泡堂BNB

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
int read(){
    int x=0;char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x;
}
const int nmax=1e5+5;
int a[nmax],b[nmax];
int main(){
    int n=read();
    rep(i,1,n) a[i]=read();
    rep(i,1,n) b[i]=read();
    sort(a+1,a+n+1);sort(b+1,b+n+1);
    int l=1,r=n,s=1,t=n,ans=0;
    rep(i,1,n){
        if(a[l]>b[s]) ans+=2,++l,++s;
        else if(a[r]>b[t]) ans+=2,--r,--t;
        else ans+=(a[l]==b[t]),++l,--t;
    }
    l=1,r=n,s=1,t=n;int res=0;
    rep(i,1,n){
        if(b[l]>a[s]) res+=2,++l,++s;
        else if(b[r]>a[t]) res+=2,--r,--t;
        else res+=(b[l]==a[t]),++l,--t;
    }
    printf("%d %d\n",ans,n+n-res);
    return 0;
}