Cover Points

1000ms

262144K

Description:

There are $$$n$$$ points on the plane, $$$(x_1,y_1), (x_2,y_2), \ldots, (x_n,y_n)$$$.

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 \leq n \leq 10^5$$$).

Each of the next $$$n$$$ lines contains two integers $$$x_i$$$ and $$$y_i$$$ ($$$1 \leq x_i,y_i \leq 10^9$$$).

Output:

Print the minimum length of the shorter side of the triangle. It can be proved that it's always an integer.

Sample Input:

Sample Output:

Sample Input:

Sample Output:

Note:

Illustration for the first example: $\text{[math]}$

Illustration for the second example: $\text{[math]}$

Informação

Provedor Codeforces

Código CF1047B