LightOJ 1198

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
/// Constants
#define eps                1e-9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1000009

int main()
{
    int tc;
    cin>>tc;
    loop(cs,1,tc){
        int n;
        cin>>n;
        vi t1(n),t2(n);
        loop(j,0,n-1){
            cin>>t1[j];
        }
        loop(j,0,n-1){
            cin>>t2[j];
        }
        sort(all(t1));
        sort(all(t2));
        int pnt=0;
        for(int i=0,j=0;i<n;i++,j++){
            if(t1[i]<t2[j]){
                j--;
                continue;
            }
            if(t1[i]>t2[j]){
                pnt+=2;
                continue;
            }
            if(t1[i]==t2[j]){
                bool flg=1;
                for(int x=i+1,y=j+1; x<n; x++,y++){
                    if(t1[x]<=t2[y] && t1[x]>t1[i]){
                        flg=0;
                        break;
                    }
                }
                if(flg){
                    pnt++;
                }
                else{
                    j--;
                }
            }
        }
        cspf(cs);
        pfi(pnt);line;
    }
    return 0;
}