← 返回题目
题库练习 Cover Points
← 上一题 下一题 →

A12138 | Cover Points

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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
C++ 编辑器
输入
输出