HDU 1896 Stones

Problem Description

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.

 

Sample Input

  
  

   
   2
2
1 5
2 4
2
1 5
6 6
  
  

 

Sample Output

  
  

   
   11
12
  
  

 

Author

Sempr|CrazyBird|hust07p43

 

题目大意：

扔石头问题，一个人从0位置开始，在路上遇到石头，如果遇到石头次数是奇数次，则将石头扔出去，如果是偶数次，则跳过石头不扔。问最终距离起始位置最远的石头是多少距离。

解题思路：

本题可以选用优先队列和数组排序的方法进行处理，在优先队列中，我们可以利用石头的位置作为优先级标准进行排序，如果遇到石头的次数是奇数次则将石头扔出去，并更新该石头的位置，并将原先的位置提出队列，形成新的优先队列。如果事偶数，则直接将石头踢出队列即可。