zoukankan      html  css  js  c++  java
  • hdoj- Windows Message Queue

                        Windows Message Queue

    Problem Description
    Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system will add a message to the queue. Meanwhile, the process will do a loop for getting message from the queue according to the priority value if it is not empty. Note that the less priority value means the higher priority. In this problem, you are asked to simulate the message queue for putting messages to and getting message from the message queue.
     

    Input
    There's only one test case in the input. Each line is a command, "GET" or "PUT", which means getting message or putting message. If the command is "PUT", there're one string means the message name and two integer means the parameter and priority followed by. There will be at most 60000 command. Note that one message can appear twice or more and if two messages have the same priority, the one comes first will be processed first.(i.e., FIFO for the same priority.) Process to the end-of-file.
     

    Output
    For each "GET" command, output the command getting from the message queue with the name and parameter in one line. If there's no message in the queue, output "EMPTY QUEUE!". There's no output for "PUT" command.
     

    Sample Input
    GET PUT msg1 10 5 PUT msg2 10 4 GET GET GET
     

    Sample Output
    EMPTY QUEUE! msg2 10 msg1 10 EMPTY QUEUE!
     

    代码

    #include<stdio.h>
    #include<string.h>
    #include<queue>
    using namespace std;
    struct Message
    {
    	char str[100];
    	int l;
    	int z;
    	int por;
    friend bool operator < (Message a,Message b)
    {
    	if(a.por==b.por)
    	return a.z>b.z;
    	else return a.por>b.por;
    }
    };
    int main()
    {
    	int i,j,z=1;
    	Message message1;
    	Message message2;
    	char mess[100];
    	priority_queue<Message>q;
    	while(!q.empty()) q.pop();
    	while(~scanf("%s",mess))
    	{
    		
    		
    		if(strcmp(mess,"PUT")==0)
    		{
    			message1.z=z++;
    			scanf("%s%d%d",message1.str,&message1.l,&message1.por);
    			q.push(message1);
    		}
    		
    		if(strcmp(mess,"GET")==0)
    		{
    			if(q.empty()==1) 
    			printf("EMPTY QUEUE!
    ");
    			else
    			{
    				message2=q.top();
    				q.pop();
    				printf("%s %d
    ",message2.str,message2.l);
    			}
    		}
    	}
    	return 0;
    }



     

  • 相关阅读:
    数据库分区与分表
    Paxos算法简单介绍
    Zookeeper实现分布式锁服务(Chubby)
    java.lang.OutOfMemoryError: Java heap space错误及处理办
    关于分布式事务、两阶段提交协议、三阶提交协议
    Volatile
    寻找数组中只出现一次的数
    堆排序
    二叉树遍历 递归非递归
    redis 数据类型
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273859.html
Copyright © 2011-2022 走看看