#include #include #include #include #include #include using namespace std; map m, score; map ::iterator it; set s; set ::iterator t; vector v; vector ::iterator it1; int main(){ int a, b, ok; string t1, t2; //freopen("input.txt", "r", stdin); for(int i = 0; i < 6; ++i){ cin >> t1 >> t2 >> a >> b; it = m.find(t1); if(it == m.end()) m[t1] = 0; it = m.find(t2); if(it == m.end()) m[t2] = 0; it = score.find(t1); if(it == score.end()) score[t1] = 0; it = score.find(t2); if(it == score.end()) score[t2] = 0; if(a > b) m[t1] += 3; if(a < b) m[t2] += 3; if(a == b){ m[t1] ++; m[t2] ++; } score[t1] += a; score[t2] += b; s.insert(t1); s.insert(t2); } /* for(t = s.begin(); t != s.end(); ++t) cout << *t << " " << m[*t] << '\n';*/ for(t = s.begin(); t != s.end(); ++t){ ok = 0; for(it1 = v.begin(); it1 != v.end(); ){ if(m[*it1] < m[*t] || (m[*it1] == m[*t] && score[*it1] < score[*t]) || (m[*it1] == m[*t] && score[*it1] == score[*t] && *it1 > *t)){ v.insert(it1, *t); ok = 1; break; } ++it1; } if(!ok) v.push_back(*t); } for(int i = 0; i < v.size(); ++i) cout << v[i] << '\n'; return 0; }