【题解】codeforces1047B[Codeforces Round #511 (Div. 2)]B.Cover Points 数学知识

题目链接

Description

There are $n$ points on the plane, $(x_1,y_1),(x_2,y_2),\dots ,(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≤n≤105).

Each of the next n lines contains two integers xi and yi (1≤xi,yi≤109).

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

Note

Illustration for the first example:

Illustration for the second example:

---

假设最后答案为 $l$，则对于 $\forall (x,y)$，$x+y-l\le 0$，化简得 $l\ge x+y$ 。$x+y$ 的最大值即为所求。

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	//freopen("in.txt","r",stdin);
	int n,x,y,maxn=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	    scanf("%d%d",&x,&y),maxn=max(maxn,x+y);
	printf("%d\n",maxn);
	return 0;
}

总结

偏要用线性规划做。