代码-AGC002E Candy Piles

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);i>=0;--i)
const int iinf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;

//Data
const int N=1e5;
int n,a[N+1];

//Main
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n;
    R(i,n) cin>>a[i];
    sort(a,a+n,greater<int>());
    R(i,n){
        if(i+2>a[i+1]){
            int j=0;
            while(a[i+j+1]==i+1) j++;
            if((j&1)||((i+1-a[i])&1)) cout<<"First\n",exit(0);
            else cout<<"Second\n",exit(0);
        }
    }
    return 0;
}