HDU1896 Stones 简单队列

优先队列

#include<stdio.h>
#include<queue>
using namespace std;
struct node
{
    int p,d;  
    friend bool operator<(node a,node b)
    {
        if(a.p==b.p) return a.d>b.d;
        return a.p>b.p;
    }     
}cur,next;
int main()
{
    int t,n;  
    priority_queue<node>q;  
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int step=1;
        while(n--)
        {
            scanf("%d %d",&cur.p,&cur.d);  
            q.push(cur);    
        }     
            while(!q.empty())
            {
                cur=q.top();
                q.pop();
                if(step) 
                {
                    cur.p+=cur.d;
                    q.push(cur);   
                }
                step=(step+1)%2;              
            }     
        printf("%d
",cur.p);    
    }
}