7-7 Windows消息队列 (25分)

#include<bits/stdc++.h>
using namespace std;
typedef struct LNode
{
    int data;
    char name[12];
    struct LNode *next;
    bool operator < (const LNode & a) const
    {
        return data > a.data;
    }
} LNode;
priority_queue <LNode> List;
int main()
{
    int num;
    char c[5];
    scanf("%d", &num);
    for(int i = 0; i < num; i++)
    {
        scanf("%s", c);
        if(c[0] == 'P')
        {
            LNode *l_node;
            l_node = new LNode;
            scanf("%s %d", l_node->name, &l_node->data);
            List.push(*l_node);
        }
        else
        {
            if(List.size() == 0)
                printf("EMPTY QUEUE!\n");
            else
                printf("%s\n", List.top().name);
            List.pop();
        }
    }

}