Codeforces Round #281 (Div. 2) - B

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 200100;
vector<long long> c,d;
int main()
{
    int n;
    long long sum[2];
    sum[0]=sum[1]=0;
    scanf("%d",&n);
    int last;
    for(int i=1;i<=n;i++)
    {
        long long x;
        scanf("%I64d",&x);
        if(x > 0){
              c.push_back(x);
              sum[0]+=x;
        }
        else{
             d.push_back(-x);
             sum[1]+=(-x);
        }
        if(i==n) {
             if(x >0) last=0;
             else last=1;
        }
    }
    if(sum[0] != sum[1]){
          printf("%s\n",sum[0]>sum[1] ?"first":"second");
          return 0;
    }
    if(c.size() > d.size()){
          for(int i=0;i<d.size();i++){
              if(c[i] < d[i]){
                  printf("second\n"); return 0;
              }
              else if(c[i] > d[i]) break;      //串的比较这个条件不可省略，切记
          }
          printf("first\n"); return 0;
    }
    else if(c.size() < d.size()){
           for(int i=0;i<c.size();i++){
              if(c[i] > d[i]){
                  printf("first\n"); return 0;
              }
              else if(c[i] < d[i]) break;
          }
          printf("second\n"); return 0;
    }
    else {
         for(int i=0;i<c.size();i++){
              if(c[i] < d[i]){
                  printf("second\n"); return 0;
              }
              if(c[i] > d[i]){
                  printf("first\n"); return 0;
              }
         }
    }
    printf("%s\n",last==0 ?"first":"second");
    return 0;
}