[Codeforces493B] Vasya and Wrestling

描述 Description

Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins.

When the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins.

If the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won.

输入格式 InputFormat

The first line contains number n — the number of techniques that the wrestlers have used (1 ≤ n ≤ 2·105).

The following n lines contain integer numbers ai (|ai| ≤ 109, ai ≠ 0). If ai is positive, that means that the first wrestler performed the technique that was awarded with ai points. And if ai is negative, that means that the second wrestler performed the technique that was awarded with ( - ai) points.

The techniques are given in chronological order.

输出格式 OutputFormat

If the first wrestler wins, print string “first”, otherwise print “second”

5
1
2
-3
-4
3

second

Codeforces 493B

代码 Code

``````#include <stdio.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
ll i,j,t,n,m,l,r,k,z,y,x;
ll a[200005],b[200005];
ll suma,sumb;
int main()
{
scanf("%I64d",&n);
a[0]=b[0]=0;
suma=sumb=0;
for (i=1;i<=n;i++)
{
scanf("%I64d",&x);
if (x>0)
{
a[++a[0]]=x;
suma+=x;
}
if (x<0)
{
b[++b[0]]=-x;
sumb+=-x;
}
t=x;
}
if (suma>sumb) printf("first\n");
else if (suma<sumb) printf("second\n");
else
{
for (i=1;i<=max(a[0],b[0]);i++) if (a[i]!=b[i]) break;
if (a[i]>b[i]) printf("first\n");
else if (a[i]<b[i]) printf("second\n");
else
{
if (t>0) printf("first\n");
else printf("second\n");
}
}
return 0;
}``````