hdu 1509 & hdu 1873 & hdu 1896 (基础优先队列)

http://acm.hdu.edu.cn/showproblem.php?pid=1509

裸的优先队列的应用,输入PUT的时候输入名字,值和优先值进队列,输入GRT的时候输出优先值小的名字和对应的值

注意的是优先级一样的时候输出顺序在前的

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
struct point {
    int val,odr,num;
    char na[101];
    bool operator <(const point & q)const
    {
        if (odr==q.odr) return num>q.num;
        else return odr>q.odr;
    }
};
int main()
{
    char lsy[5];
    int k=0;
    point temp;
    priority_queue<point>que;
    while (~scanf("%s",lsy))
    {
        if (strcmp(lsy,"GET")==0)
        {
            if (que.size()!=0)
            {
                temp=que.top();
                que.pop();
                printf("%s %d
",temp.na,temp.val);
            }
            else
                printf("EMPTY QUEUE!
");
        }
        else
        {
            scanf("%s %d %d",temp.na,&temp.val,&temp.odr);
            temp.num=k++;
            que.push(temp);
        }
    }
    return 0;
}

http://acm.hdu.edu.cn/showproblem.php?pid=1873

也很简单的优先队列,有三个医生的,每个医生又自己的顺序,所以可以建立三个队列

#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
struct point {
    int x,num;
    bool operator <(const point & q)const
    {
        if (x==q.x) return num>q.num;
        else return x<q.x;
    }
};
int main()
{
    int t,x,y;
    char lsy[5];
    priority_queue<point> a,b,c;
    point temp;
    while (~scanf("%d",&t))
    {
        int k=1;
        while (a.size()!=0)
           a.pop();
        while (b.size()!=0)
           b.pop();
        while (c.size()!=0)
           c.pop();
        while (t--)
        {
            scanf("%s",lsy);
            if (strcmp(lsy,"IN")==0)
            {
                scanf("%d %d",&x,&y);
                temp.num=k++;
                temp.x=y;
                if (x==1) a.push(temp);
                else if (x==2) b.push(temp);
                else c.push(temp);
            }
            else
            {
                scanf("%d",&x);
                if (x==1)
                {
                    if (a.size()==0)
                        printf("EMPTY
");
                    else
                    {
                        temp=a.top(),a.pop();
                        printf("%d
",temp.num);
                    }
                }
                else if (x==2)
                {
                    if (b.size()==0)
                        printf("EMPTY
");
                    else
                    {
                        temp=b.top(),b.pop();
                        printf("%d
",temp.num);
                    }
                }
                else
                {
                    if (c.size()==0)
                        printf("EMPTY
");
                    else
                    {
                        temp=c.top(),c.pop();
                        printf("%d
",temp.num);
                    }
                }
            }
        }
    }
    return 0;
}

http://acm.hdu.edu.cn/showproblem.php?pid=1896

题意 遇到第奇数个的石头就把它往前扔规定的距离,遇到第偶数个的石头就不动它 问最远的石头据出发点(起点)的距离

优先队列的应用,想到优先队列就很好解决了

#include<cstdio>
#include<queue>
using namespace std;
struct point {
    int x,y;
    bool operator <(const point & q) const
    {
        if (x==q.x) return y>q.y;
        else return x>q.x;
    }
};
int main()
{
    int t,n;
    while (~scanf("%d",&t))
    {
        while (t--)
        {
            int k=1;
            priority_queue<point> que;
            point temp;
            scanf("%d",&n);
            while (n--)
            {
               scanf("%d %d",&temp.x,&temp.y);
               que.push(temp);
            }
            while (!que.empty())
            {
                temp=que.top(),que.pop();
                if (k%2==1)
                {
                    temp.x+=temp.y;
                    que.push(temp);
                }
                k++;
            }
            printf("%d
",temp.x);
        }
    }
    return 0;
}