cf 19a World Football Cup

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;
struct node
{
    string na;
    int points;
    int scored;
    int missed;
    int dif;
}nn[55];
bool cmp1(const node &n1,const node &n2)
{
    if(n1.points!=n2.points)
        return n1.points>n2.points;
    else if(n1.dif!=n2.dif)
        return n1.dif>n2.dif;
    else if(n1.scored!=n2.scored)
        return n1.scored>n2.scored;
}
bool cmp2(const node &n1,const node &n2)
{
    return n1.na<n2.na;
}
int get(string s)
{
    if(s.length()==1)
        return s[0]-'0';
    else if(s.length()==2)
        return 10*(s[0]-'0')+s[1]-'0';
    else if(s.length()==3)
        return 100;
}
int n;
int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        cin>>nn[i].na;
    string ss,s,s1,s2,s3,s4;
    map<string,int> tp,ts,tm;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            cin>>ss>>s;
            int p=ss.find('-');
            s3=ss.substr(0,p);
            s4=ss.substr(p+1,ss.length()-1-p);
            //----
            p=s.find(':');
            s1=s.substr(0,p);
            s2=s.substr(p+1,s.length()-1-p);
            int a1=get(s1);
            int a2=get(s2);
            ts[s3]+=a1;
            tm[s3]+=a2;
            ts[s4]+=a2;
            tm[s4]+=a1;
            if(a1>a2)
                tp[s3]+=3;
            else if(a1<a2)
                tp[s4]+=3;
            else if(a1==a2)
            {
                tp[s3]++;
                tp[s4]++;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        nn[i].points=tp[nn[i].na];
        nn[i].scored=ts[nn[i].na];
        nn[i].missed=tm[nn[i].na];
        nn[i].dif=nn[i].scored-nn[i].missed;
    }
    sort(nn,nn+n,cmp1);
    int tt=n/2;
    sort(nn,nn+tt,cmp2);
    for(int i=0;i<tt;i++)
        cout<<nn[i].na<<"\n";
    return 0;
}