【BZOJ 1982】[Spoj 2021] Moving Pebbles

题目传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=1982

同POJ_1740

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int MAXN = 100000+9;

int arr[MAXN],n;

inline int read(){
	char c=getchar(); int ret=0;
	while (c<'0'||c>'9') c=getchar();
	while (c<='9'&&c>='0') ret=ret*10+c-'0',c=getchar();
	return ret;
}

int main(){
	while (~scanf("%d",&n)) {
		for (int i=1;i<=n;i++) arr[i] = read();
		sort(arr+1,arr+1+n);
		if (n%2) {cout<<"first player"<<endl; continue;} int tag = 1;
		for (int i=1;i<=n;i+=2) if (arr[i] != arr[i+1]) {cout<<"first player"<<endl; tag = 0; break;}
		if (tag) cout<<"second player"<<endl;
	}
	return 0;
}