FZU 2265 Card Game (Second Edition)

http://acm.fzu.edu.cn/problem.php?pid=2265

又是玄学求期望

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
	int T;
	int n;
	int cmp=0;
	int a[10010];
	int b[10010];
	cin>>T;
	while(T--)
	{
		scanf("%d",&n);
		cmp++;
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(int i=0;i<n;i++)
			scanf("%d",&b[i]);
		sort(a,a+n);
		sort(b,b+n);
		int id1=0;
		int id2=0;
		double res=0;
		for(int i=0;i<n;i++)
		{
			res+=lower_bound(b,b+n,a[i])-b;
		}
		printf("Case %d: %.2f\n",cmp,res/n);
	}
	return 0;
}