自定义优先队列

#include<stdio.h>
#include<queue>
using namespace std;


struct node
{
    friend bool operator< (node x,node y)
    {
        return x.pre>y.pre;// > 表示从小到大，< 表示从大到小;根据pre来判优先度;
    }
    int pre;
    int val;
};

int main()
{
    int i,j;
    node a[1000];
    int n;
    priority_queue<node>q;
    while(scanf("%d",&n)!=EOF)
    {
        node z;
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&a[i].pre,&a[i].val);
            q.push(a[i]);
        }
        while(!q.empty())
        {
            node x;
            x=q.top();
            printf("%d %d\n",x.pre,x.val);
            q.pop();
        }
        
        printf("\n");
    }
}

hdu1896

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
struct node
{
    int place;
    int len;
    friend bool operator< (node a,node b)
    {
        if(a.place!=b.place)
            return a.place>b.place;
        else return a.len>b.len;
    }
};
int main()
{
    priority_queue<node>q;
    priority_queue<node>p;
    int i,j,t,n;
    node s;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&s.place,&s.len);
            q.push(s);
        }
        int odd=1;
        while(!q.empty())
        {
            s=q.top();
            q.pop();
            
            if(odd)
            {
                s.place+=s.len;
                q.push(s);
            }
            odd=!odd;
        }
        printf("%d\n",s.place);
    /*    while(scanf("%d",&n)!=EOF)
        {
            for(i=0;i<n;i++)
            {
                scanf("%d",&s.place);
                p.push(s);
            }
            while(!p.empty())
            {
                s=p.top();
                p.pop();
                printf("%d ",s.place);
            }
            printf("\n");
        }*/
    }
}