Codeforces•Jul 13, 2025
Cover Points
Hazrat Ali
Codeforces
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the triangle). Calculate the minimum length of the shorter side of the triangle.
Input
First line contains one integer n (1≤n≤10).
Each of the next n lines contains two integers xi and yi (1≤xi,yi≤).
Output
Print the minimum length of the shorter side of the triangle. It can be proved that it's always an integer.
Examples
Input
3
1 1
1 2
2 1
Output
3
Input
4
1 1
1 2
2 1
2 2
Output
4
Solution
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int ans = -1;
for (int i = 0; i < n; i++)
{
int x, y;
cin >> x >> y;
ans = max(ans, x + y);
}
cout << ans << endl;
return 0;
}