nyoj811变态最大值

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int n,a[3];
int cmp[3334];
while(scanf("%d",&n) != EOF)
{
for(int i = 1;i <= n/3;i++)
{
getchar();
scanf("%d %d %d",&a[0],&a[1],&a[2]);
if(i%2 != 0)
{
int max = a[0];
for(int j = 1;j < 3;j++)
{
if(max < a[j]) max = a[j];
}
cmp[i-1] = max;
}
else
{
int min = a[0];
for(int j = 1;j < 3;j++)
{
if(min > a[j]) min = a[j];
}
cmp[i-1] = min;
}
}
sort(cmp,cmp+(n/3));
printf("%d\n",cmp[n/3-1]);
}


}