zoukankan      html  css  js  c++  java
  • hdoj 1509 Windows Message Queue【优先队列】

    Windows Message Queue

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 4352    Accepted Submission(s): 1726


    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 node
    {
    	char s[110];
    	int can;
    	int first;
    	int time;
    	friend bool operator < (node a,node b)
    	{
    		if(a.first!=b.first)
    		return a.first>b.first;
    		else
    		return a.time>b.time;
    	}
    };
    int main()
    {
    	int n,m,j,i,t;
    	char str[10],s1[110];
    	priority_queue<node>q;
    	node x;
    	int k=0;
    	while(scanf("%s",str)!=EOF)
    	{
    		if(str[0]=='G')
    		{
    			if(q.empty())
    			{
    				printf("EMPTY QUEUE!
    ");
    			}
    			else
    			{
    				x=q.top();
    				printf("%s %d
    ",x.s,x.can);
    				q.pop();
    			}
    		}
    		else
    		{
    			k++;
    			scanf("%s %d %d",s1,&n,&m);
    			strcpy(x.s,s1);
    			x.can=n;
    			x.first=m;
    			x.time=k;
    			q.push(x);
    		}
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    【算法】动态规划
    【设计模式】单例模式
    Python 多元线性回归
    Python 线性回归
    惩罚项
    局部常数拟合方法 例
    微分方程是用来做什么的?
    线性回归与梯度下降法
    k近邻法
    逻辑回归与梯度下降法
  • 原文地址:https://www.cnblogs.com/tonghao/p/4682767.html
Copyright © 2011-2022 走看看