CodeForce 2A Winner

很多人玩一个游戏，每一轮有一个人得分或者扣分，最后分数最高的人夺冠；如果最后有多个人分数都是最高的，则这些人里面，在比赛过程中首先达到或者超过这个分数的人夺冠。现在给定最多1000轮每轮的情况，求最后的冠军是谁。

========================================================================================

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cstdlib>
using namespace std;
typedef long long LL;
const LL INF = 0xffffff;
const int maxn = ;
const LL MOD = 1e9+;
struct node
{
    char name[maxn];
    int coun;
    int sorce;
} P[maxn], ans, Read[maxn];
///

int main()
{
    int n, k = , i, j, Max = -INF;
    memset(P, , sizeof(P));
    ans.sorce = -INF;
    cin >> n;

    for(i=; i<n; i++)
    {
        cin >> Read[i].name >> Read[i].sorce;

        for(j=; j<k; j++)
        {
            if(strcmp(P[j].name, Read[i].name) == )
            {
                P[j].sorce += Read[i].sorce;
                break;
            }
        }

        if(j == k)
        {
            strcpy(P[j].name,Read[i].name);
            P[k++].sorce = Read[i].sorce;
        }
    }

    for(i=; i<k; i++)
        Max = max(P[i].sorce, Max);
    k = ;
    memset(P, , sizeof(P));

    for(i=; i<n; i++)
    {
        for(j=; j<k; j++)
        {
            if(strcmp(P[j].name, Read[i].name) == )
            {
                P[j].sorce += Read[i].sorce;
                if(P[j].sorce >= Max && P[j].coun == -)
                    P[j].coun = i;
                break;
            }
        }

        if(j == k)
        {
            strcpy(P[j].name,Read[i].name);
            P[k++].sorce = Read[i].sorce;
            P[j].coun = -;
            if(P[j].sorce >= Max)
                P[j].coun = i;
        }
    }

    for(i=; i<k; i++)
    {
        if(ans.sorce < P[i].sorce || (ans.sorce == P[i].sorce && P[i].coun < ans.coun) )
            ans = P[i];
    }

    cout << ans.name << endl;
    return ;
}