砂漠の公園 [MISSION LEVEL: B]

#include <bits/stdc++.h>
#define _for(i,a,b) for(int i = (a);i < (b);i ++)
#define pb push_back
using namespace std;

struct TEAM
{
    int num;
    int win;
    int dogfall;
    int lose;
    int score;
};

int cmp(const void *a,const void *b)
{
    TEAM *c = (TEAM *)a;
    TEAM *d = (TEAM *)b;
    if(c->score < d->score)
        return 1;
    return -1;
}

void show(TEAM *teamList,int n)
{
    _for(j,0,n)
    printf("%d %d %d %d %d
",teamList[j].num,teamList[j].score,
        teamList[j].win,teamList[j].dogfall,teamList[j].lose);
}

int main()
{
    int n;
    while(cin >> n)
    {
        TEAM teamList[n];
        memset(teamList,0,sizeof(teamList));
        _for(i,0,n)
            teamList[i].num = i+1;
        _for(i,0,n)
        {
            _for(j,0,n)
            {
                char tmp;
                cin >> tmp;
                if(tmp=='W')
                {
                    teamList[i].win ++;
                    teamList[i].score += 2;
                }
                else if(tmp=='D')
                {
                    teamList[i].dogfall ++;
                    teamList[i].score += 1;
                }
                else if(tmp=='L')
                {
                    teamList[i].lose ++;
                }
            }
        }
        qsort(teamList,n,sizeof(TEAM),cmp);
    //    show(teamList,n);
        printf("%d %d %d %d %d",teamList[0].num,teamList[0].score,
        teamList[0].win,teamList[0].dogfall,teamList[0].lose);
    }
    return 0;
}