Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <bits/stdc++.h>
- using namespace std;
- int T;
- map < string , int > pts , goals;
- bool cmp(const string &a , const string &b){
- if(pts[a] > pts[b]) return 1;
- if(pts[a] < pts[b]) return 0;
- if(goals[a] > goals[b]) return 1;
- return 0;
- }
- int main(){
- cin>>T;
- while(T--){
- pts.clear();
- goals.clear();
- set < string > teams;
- for(int j = 0 ; j < 12 ; j++){
- string team1 , team2 , tok;
- int g1 , g2;
- cin>>team1>>g1>>tok>>g2>>team2;
- if(g1 > g2) pts[team1] += 3;
- else if(g1 < g2) pts[team2] += 3;
- else pts[team1]++ , pts[team2]++;
- goals[team1] += g1 - g2;
- goals[team2] += g2 - g1;
- teams.insert(team1);
- teams.insert(team2);
- }
- vector < string > v(teams.begin() , teams.end());
- sort(v.begin() , v.end() , cmp);
- cout<<v[0]<<' '<<v[1]<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement