Mice and holes#10173
There are mice and holes on a straight line. Each hole can only accommodate mouse. A mouse can stay in its place, move one step to the right from to x + 1, or move one step to the left from to x - 1. Any of these moves takes minute. Assign mice to holes so that the time when the last mouse hides in a hole is minimized.
The first line contains the number n~(n \le 10^5). The second line contains the coordinates of mice. The third line contains the coordinates of holes. The coordinates of mice and holes are integers from to 10^9.
Print the minimum time it takes for the last mouse to hide in a hole.
Example 1