hdu1509 Windows Message Queue

来源：互联网发布：朝鲜妹子知乎编辑：程序博客网时间：2024/05/18 09:33

运算符重载

题目

#include<stdio.h>#include<iostream>#include<queue>#include<vector>#include<string>#include<algorithm>using namespace std;struct node{    string name;    int par,pri,id;    friend bool operator< (node a,node b){        if(a.pri==b.pri)            return a.id >b.id;            else return a.pri >b.pri;    }};int main(){    priority_queue <node> que;    char a[5];    int i=0;    while(~scanf("%s",a))    {        if(a[0]=='G')        {            if(que.empty())                printf("EMPTY QUEUE!\n");            else            {                node m = que.top();                //printf("%s %d\n",m.name,m.par);                cout<<m.name<<" "<<m.par<<endl;                que.pop();            }        }        if(a[0]=='P')        {            node t;           // scanf("%s%d%d",t.name,&t.par,&t.pri);           cin>>t.name>>t.par>>t.pri;            t.id=i++;            que.push(t);        }    }    return 0;}

阅读全文

0 0