Codeforces Round 118 (Div. 1)
E
Soap Time! - 2
Codeforces
3000
原题
← D→
翻译中…

Imagine the Cartesian coordinate system. There are $*k*$ different points containing subway stations. One can get from any subway station to any one instantly. That is, the duration of the transfer between any two subway stations can be considered equal to zero. You are allowed to travel only between subway stations, that is, you are not allowed to leave the subway somewhere in the middle of your path, in-between the stations.

翻译中…

There are $*n*$ dwarves, they are represented by their coordinates on the plane. The dwarves want to come together and watch a soap opera at some integer point on the plane. For that, they choose the gathering point and start moving towards it simultaneously. In one second a dwarf can move from point $(*x*, *y*)$ to one of the following points: $(*x* - 1, *y*)$, $(*x* + 1, *y*)$, $(*x*, *y* - 1)$, $(*x*, *y* + 1)$. Besides, the dwarves can use the subway as many times as they want (the subway transfers the dwarves instantly). The dwarves do not interfere with each other as they move (that is, the dwarves move simultaneously and independently from each other).

翻译中…

Help the dwarves and find the minimum time they need to gather at one point.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*k*$ $(1 ≤ *n* ≤ 10^{5}; 0 ≤ *k* ≤ 10^{5})$ — the number of dwarves and the number of subway stations, correspondingly.

翻译中…

The next $*n*$ lines contain the coordinates of the dwarves. The $*i*$-th line contains two space-separated integers $*x*_{*i*}$ and $*y*_{*i*}$ ($|*x*_{*i*}|, |*y*_{*i*}| ≤ 10^{8}$) — the coordinates of the $*i*$-th dwarf. It is guaranteed that all dwarves are located at different points.

翻译中…

The next $*k*$ lines contain the coordinates of the subway stations. The $*t*$-th line contains two space-separated integers $*x*_{*t*}$ and $*y*_{*t*}$ ($|*x*_{*t*}|, |*y*_{*t*}| ≤ 10^{8}$) — the coordinates of the $*t*$-th subway station. It is guaranteed that all subway stations are located at different points.

翻译中…

Output

翻译中…

Print a single number — the minimum time, in which all dwarves can gather together at one point to watch the soap.

翻译中…

样例

Input #1
1 0
2 -2
Output #1
0
InputCopy OutputCopy
Input #2
2 2
5 -3
-4 -5
-4 0
-3 -2
Output #2
6
InputCopy OutputCopy
题目信息
题号
185E
时间限制
6 s
内存限制
256 MB
标签
二分
数据结构

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。