HDU 1896 Stones ——STL 优先队列

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<stdlib.h>
#include<set>
#include<map>
#include<queue>
using namespace std;
struct node
{
    friend bool operator< (node n1, node n2)//自定义排序
    {
        if(n1.p==n2.p)
            return n1.d>n2.d;
        else
            return n1.p>n2.p;
    }
    int p;
    int d;
};
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        priority_queue<node> q;
        int n,i;
        cin>>n;
        for(i=0; i<n; i++)
        {
            node tn;
            cin>>tn.p>>tn.d;
            q.push(tn);
        }
        int cnt=1,distence=0;
        while(!q.empty())
        {
            distence=q.top().p;
            if(cnt%2==0)
            {
                q.pop();
            }
            else
            {
                node temp=q.top();
                temp.p+=temp.d;
                q.pop();
                q.push(temp);
            }
            cnt++;
            distence=q.top().p;
        }
        cout<<distence<<endl;
    }

    return 0;
}