CodeChef::TLG(incomplete)

 

#include <iostream>
using namespace std ;

int main(){
    int total_rounds ;
    cin >> total_rounds ;
    int player_one[total_rounds] ;
    int player_two[total_rounds] ;
    int lead[total_rounds] ;
    for (int i = 0; i < total_rounds; ++i) {
        cin >> player_one[i] >> player_two[i] ;
        if (player_one[i] > player_two[i]){
            lead[i] = player_one[i] - player_two[i] ;
        } else{
            lead[i] = player_two[i] - player_one[i] ;
        }

    }
    int largest{INT16_MIN};
    for (int i = 0; i < total_rounds; ++i) {
        if (lead[i] > largest){
            largest = lead[i];
        }
    }
    for (int i = 0; i < total_rounds; ++i) {
        if (player_one[i] - player_two[i] == largest){
            cout << 1 << " ";
        }
        if (player_two[i] - player_one[i] == largest){
            cout << 2 << " ";
        }
    }
    cout << largest << '\n' ;






    return 0 ;
}