codeforces Gym 100971 A、B、C、F、G、K、L

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <vector>
using namespace std;
const int maxn= 2e5+10;
const int maxm= 1e4+10;
const int inf = 0x3f3f3f3f;
typedef long long ll;
int n;
int a[maxn],b[maxn];
int main()
{
while(cin>>n)
{
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
sort(a+1,a+n+1);
sort(b+1,b+n+1);
int maxa=0,maxb=0,mina,minb,p=0;
for(int i=1,j=1;i<=n;)
{
if(a[i]>b[j])
{
maxa++;
i++;
j++;
}
else
{
i++;
}
}
minb=n-maxa;
for(int i=1,j=1;i<=n;)
{
if(b[i]>a[j])
{
maxb++;
i++;
j++;
}
else
{
i++;
}
}
mina=n-maxb;
//        cout<<maxa<<" "<<mina<<endl;
//        cout<<maxb<<" "<<minb<<endl;
if(maxa>n/2)
{
if(maxb>n/2)
printf("Both\n");
else
printf("First\n");
}
else
{
if(maxb>n/2)
printf("Second\n");
else
printf("None\n");
}
}
}