Day2 B - Stones

---

题目正文

Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
Input
In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
Output
Just output one line for one test case, as described in the Description.

翻译

由于自行车的错误状态，Sempr开始每天早上从东向西走，每天晚上再往回走。走路可能会让人有点累，所以Sempr这次总是玩一些游戏。

路上有很多石头，当他遇到一块石头时，如果他遇到的是奇数的石头，他会把它扔到尽可能远的地方，如果是偶数的石头，他会把它留在原来的地方。现在给你一些关于路上石头的信息，你要告诉我从起点到Sempr经过后最远石头的距离。请注意，如果两个或两个以上的石头停留在同一位置，您将首先遇到较大的石头（输入中描述的Di最小的石头）。

输入

在第一行中，有一个整数T（1<=T<=10），表示输入文件中的测试用例。然后是T检验案例。

对于每个测试用例，我将在第一行给您一个整数N（0<N<=100000），这意味着道路上的石头数量。接着是N行，行中有两个整数Pi（0<=Pi<=100000）和