Given, **N** Mice and N holes are placed in a straight line. Each hole can accommodate only 1 mouse. A mouse can stay at his position, move one step right from **x to x + 1**, or move one step left from **x to x -1**. Any of these moves consumes **1** minute. Write a program to assign mice to holes so that the time when the last mouse gets inside a hole is minimized.

**Input:**

First line of input contains a single integer **T**, which denotes the number of test cases. T test cases follows, first line of each test case contains a single integer N which denotes the number of mice and holes. Second line of each test case contains N space separated integers which denotes the position of mice initially. Third line of each test case also contains N space separated integers which denotes the position of holes.

**Output:**

For each test case in a new line print the **minimum time** required in which all the mice can get into the holes.

**Constraints:**

1 <= T <= 100

1 <= N <= 10000

**Example:**

**Input:**

2

3

4 -4 2

4 0 5

8

-10 -79 -79 67 93 -85 -28 -94

-2 9 69 25 -31 23 50 78

**Output:**

4

102

**Explanation:
Testcase 1:** The maximum absolute difference between mouse to the corresponding hole position.

Author: harsh.agarwal0

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

d_Coder00 | 134 |

dungeon_master1299 | 126 |

Astikeysingh | 120 |

rajendrashekhawat063 | 115 |

kaustavbhattachaarya | 111 |

Pulkit__Sharma__ | 646 |

Anirban166 | 531 |

abducodes | 501 |

Found_me | 454 |

Yo_Nehru | 404 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.