1445B - Elimination - CodeForces Solution

#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<iomanip>
#include<map>

/**--------------------------------**/


#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pb push_back
#define pf push_front
#define en cout<<endl;
#define yes cout<<"YES"<<endl;
#define no  cout<<"NO"<<endl;
#define no1 {cout<<-1<<endl; r0}
#define no0 {cout<<0<<endl; r0}
#define yes_r { cout<<"YES"<<endl; return ; }
#define no_r { cout<<"NO"<<endl; return ; }
#define r0 return ;
#define fr first
#define sc second
#define TT ll tt;cin>>tt;while(tt--)
#define No cout << "No" << endl ;



/**-------------------------------**/

using namespace std ;

int fact(long double n )
{
    if(n == 0)
    {
        return 1;

    }
    return  n * fact(n - 1) ;
}

/**-------------------------------**/

int cnk(int n, int k)
{
    return fact(n) / (fact(k) * fact(n - k)) ;
}

/**------------------------------**/

bool even(int n)
{
    if(n%2!=0)
        return false ;

    return true ;
}

/**------------------------------**/

int fib(int n)
{
    if(n<2)
        return n ;
    else
        return (fib(n - 1) + fib(n - 2)) ;

}

/**--------------------------------**/


/**--------------------------------**/

bool all_same(string s)
{
    for(int i=0; i<s.size(); i++)
        if(s[i]!=s[0])
            return false ;

    return true ;
}

/**---------------------------------**/

bool odd(int a)
{
    if(a%2==0)
        return false ;

    return true ;
}

void softclub()
{
}


int main()
{
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;
    cout.tie(0) ;
    TT
    {
        ll a , b , x , y ;
        cin >> a >> b >> x >> y ;
        cout << max(a + b , x + y)  << endl ;
    }









}