杭电 1896 Stones（题解+代码）

题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=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

题意：Sempr在走路的时候喜欢玩扔石头的游戏来打发时间。当他碰到 奇数次 的石头，他会把石头扔到Di远处：当他碰到第 偶数次 的石头,他不会去扔石头。当一个位置有两块石头的时候，他会扔 较轻 的那个石头，也就是说 可以扔的较远的那块石头（轻的石头才可以扔的远）。输出扔的最远的那块石头到起点的距离

题解：优先队列问题，建立结构体保存石头当前位置以及石头可以扔出去的距离，重载运算符。判断队列是否为空，以及遇到的石头是否为奇数次即可

需要注意的是：扔出去的石头在下一次碰到的时候是可以再扔的

代码及注释如下：

#include<iostream>
#include<queue>
using namespace std;
struct node{
	int pos;//石块当前位置 
	int dis;//石块可以扔出去的距离 
	friend bool operator < (node a,node b) {//运算符重载 
		if(a.pos==b.pos) return a.dis>b.dis;
		return a.pos>b.pos;
	}
};
int main() {
	int t;
	cin>>t;
	while(t--) {
		priority_queue<node> q;
		int n,num=1;//遇见石块的次数 
		node temp;
		cin>>n;//石块数量 
		for(int i=1;i<=n;i++) {
			int a,b;
			cin>>a>>b;
			temp.pos=a;//石块当前的位置 
			temp.dis=b;//石块可以扔出去的距离 
			q.push(temp);
		}
		while(!q.empty()) {//判断是否还有石块
			temp=q.top();
			q.pop();
			if(num%2) {//判断是奇数次还是偶数次 
				temp.pos+=temp.dis;//修改石块位置 
				q.push(temp);
			}
			num++;//遇见石块的次数++ 
		}
		cout<<temp.pos<<endl;//temp保存的就是最后一次扔的石块
	}
	return 0;
}