【bzoj1034】 ZJOI2008泡泡堂BNB 贪心

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 100010

using namespace std;

int a[maxn],b[maxn];
int n;

int calc(int *a,int *b)
{
	int la=1,ra=n,lb=1,rb=n,ans=0;
	while (la<=ra)
	{
		if (a[la]>b[lb]) ans+=2,la++,lb++;
		else if (a[ra]>b[rb]) ans+=2,ra--,rb--;
		else
		{
			if (a[la]==b[rb]) ans++;
			la++;rb--;
		}
	}
	return ans;
}

int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	for (int i=1;i<=n;i++) scanf("%d",&b[i]);
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	printf("%d %d\n",calc(a,b),2*n-calc(b,a));
	return 0;
}