CF1047B.Cover Points

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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$ ).

输出格式

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

输入输出样例

输入#1
```
3
1 1
1 2
2 1
```
输出#1
```
3
```
输入#2
```
4
1 1
1 2
2 1
2 2
```
输出#2
```
4
```

说明/提示

Illustration for the first example:

Illustration for the second example:

首页