1047B - Cover Points - CodeForces Solution


geometry math *900

Please click on ads to support us..

Python Code:

a=[]

for i in range(int(input())):
	x, y=map(int,input().split())
	a.append(x+y)
    
print(max(a))
  							    		  	  				   		 	

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
const long long MOD = 1e9 + 7, OO = 1e18;
const double PI = acos(-1);
const int N = 1e5 + 5;
int main() {
    IO
    ll n,x,y,mx=0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> x >> y;
        mx = max (mx,x+y);
    }
    cout << mx;
    
    
    
    return 0;
}


Comments

Submit
0 Comments
More Questions

462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home