fzu-2265

B - Card Game (Second Edition)

Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card deck. The game goes for N rounds and in each round, Fat Brother and Maze would draw one card from their own remaining card deck randomly and compare for the integer which is written on the cards. The player with the higher number wins this round and score 1 victory point. And then these two cards are removed from the game such that they would not appear in the later rounds. As we all know, Fat Brother is very clever, so he would like to know the expect number of the victory points he could get if he knows all the integers written in these cards.

Note that the integers written on these N*2 cards are pair wise distinct. At the beginning of this game, each player has 0 victory point.

Input

The first line of the data is an integer T (1 <= T <= 100), which is the number of the text cases.

Then T cases follow, each case contains an integer N (1 <=N<=10000) which described before. Then follow two lines with N integers each. The first N integers indicate Fat Brother’s cards and the second N integers indicate Maze’s cards.

All the integers are positive and no more than 10000000.

Output

For each case, output the case number first, and then output the expect number of victory points Fat Brother would gets in this game. The answer should be rounded to 2 digits after the decimal point.

Sample Input

211221 32 4

Sample Output

Case 1: 0.00Case 2: 0.50

思路：
这道题是求他们分别随机拿牌，胖子获胜的概率，思路就是把它们每一把的概率算出来然后加起来
我们用a数组存胖子的牌，用b存另一个的牌，先算出胖子不能获胜的概率，最后用n减去就行
实际上，我们只需要遍历一下a中的每一个元素，然后找出在b数组里面，有多少个数大于他，然后一直把a数组遍历完，得到的数是sum
然后求出：(n-sum/n)就是最后的答案
代码:
#include<algorithm>#include<cstdio>using namespace std;int a[10010],b[10010];int main(){    int t,cas;    scanf("%d",&t);    for(int cas=1; cas<=t; cas++)    {        int n,m,sum=0;        scanf("%d",&n);        for(int i=0; i<n; i++)scanf("%d",&a[i]);sort(a,a+n);        for(int i=0; i<n; i++)scanf("%d",&b[i]);sort(b,b+n);        for(int i=0; i<n; i++)        {            int x=upper_bound(b,b+n,a[i])-b;            sum+=n-x;        }        printf("Case %d: %.2f\n",cas,double(n-sum*1.0/n));    }    return 0;}