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
题意:从左到右还是西到东,反正一个方向有石头,每个石头都有可以扔掉的距离,叠在一起的石头先扔可以扔的远的,问最远的石头有多远,奇数可以扔,偶数不扔。
思路:优先队列,保存石头信息即可。
代码如下:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
typedef long long ll;
using namespace std;
struct Node
{
int p;
int d;
};
struct cmp
{
bool operator() (const Node a,const Node b)const //a优先级小于b,返回true
{
if(a.p==b.p) return a.d>b.d;
else return a.p>b.p;
}
};
int main()
{
int t,n;
cin>>t;
while(t--)
{
priority_queue <Node,vector<Node>,cmp> pq;
Node node;
cin>>n;
while(!pq.empty()) pq.pop();
for(int i=0;i<n;i++)
{
cin>>node.p>>node.d;
pq.push(node);
}
int flag=1;
while(!pq.empty())
{
node=pq.top(); pq.pop();
if(flag%2==1)
{
node.p+=node.d;
pq.push(node);
}
flag++;
}
cout<<node.p<<endl;
}
return 0;
}