6. The world cup is coming

【 Problem description 】

       2018 The world cup in Russia is over , France won the championship , Fans all over the world had a very happy summer . As a Chinese fan , You can't always watch others play football , This is not welfare , according to FIFA（ FIFA ） And the unanimous decision of all member associations ,2118 The world cup will be held in China , As the host , The Chinese team will directly participate in the Finals without participating in the qualifiers .

   The rules of the game are as follows ：

• in total n（n For the even ） Teams play

• Rank according to the points of the group match , front n/2 Our team entered the knockout

• The rules for ranking points are as follows ： The team won 3 branch , A draw would be 1 branch , Defeated 0 branch , Decrease by integral 、 Ranking by decreasing goal difference and decreasing number of goals

  Write a program , According to the list of participating teams and the results of all competitions , Find out the list of teams that have successfully entered the knockout stage .

【 Input form 】

        The first line of input contains a unique integer n(1<=n<=50), The number of teams participating in the World Cup finals . Next n OK is the name of each team , Is not longer than 30 English characters of characters . Next n*(n-1)/2 That's ok , Format per line name1-name2 num1:num2（0<=num1, num2<=100）, It means the team and score . 

【 Output form 】

        Input n/2 That's ok , It means the team entering the knockout stage , Arrange in dictionary order , Each team name is on one line .
【 The sample input 】

4
A
B
C
D
A-B 1:1
A-C 2:2
A-D 1:0
B-C 1:0
B-D 0:3
C-D 0:3

【 Sample output 】

A
D

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
struct Team
{
    string name;
    int score=0;
    int ncount=0;
    int mcount=0;
};
bool cmp(Team a, Team b)
{
    if (a.score==b.score)
    {
        if(a.ncount==b.ncount)
            return a.mcount>b.mcount;
        else
            return a.ncount>b.ncount;
    }
    else
        return a.score>b.score;
}
map<string,int>maps;
bool cmp1(Team a,Team b)
{
    return maps[a.name]<maps[b.name];

}
int main()
{
    int n;
    cin>>n;

    Team team[n];
    for(int i=0;i<n;i++)
    {
        string str;
        cin>>str;
        team[i].name=str;
        maps[str]=i;
    }

    int m=n*(n-1)/2;

    for(int i=0;i<m;i++)
    {
        string team1,team2,vs,st;
        char vt;
        int score1,score2;
        cin>>st>>score1>>vt>>score2;//A-B 3:2
        stringstream ss(st);
        string sub_str;

        getline(ss,sub_str,'-');
        team1=sub_str;

        getline(ss,sub_str,'-');
        team2=sub_str;

        int n1=maps[team1],n2=maps[team2];
        team[n1].mcount+=score1;
        team[n2].mcount+=score2;
        if(score1!=score2)
        {
            if(score1>score2)
            {
                team[n1].score+=3;
                team[n1].ncount+=abs(score1-score2);
                team[n2].ncount-=abs(score1-score2);
            }
            else
            {
                team[n2].score+=3;
                team[n2].ncount+=abs(score1-score2);
                team[n1].ncount-=abs(score1-score2);
            }
        }
        else
        {
            team[n1].score+=1;
            team[n2].score+=1;
        }
    }

    sort(team,team+n,cmp);

    for(int i=0;i<n/2;i++)
    {
        sort(team,team+n/2,cmp1);
        cout<<team[i].name<<endl;
    }

    return 0;
}