HDU 1908 Double Queue （解题报告）

 Problem Description

The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment provided by IBM Romania, and using modern information technologies. As usual, each client of the bank is identified by a positive integer K and, upon arriving to the bank for some services, he or she receives a positive integer priority P. One of the inventions of the young managers of the bank shocked the software engineer of the serving system. They proposed to break the tradition by sometimes calling the serving desk with the lowest priority instead of that with the highest priority. Thus, the system will receive the following types of request:

Your task is to help the software engineer of the bank by writing a program to implement the requested serving policy.

 

 

Input

Each line of the input contains one of the possible requests; only the last line contains the stop-request (code 0). You may assume that when there is a request to include a new client in the list (code 1), there is no other request in the list of the same client or with the same priority. An identifier K is always less than 10 ⁶, and a priority P is less than 10 ⁷. The client may arrive for being served multiple times, and each time may obtain a different priority.

 

 

Output

For each request with code 2 or 3, the program has to print, in a separate line of the standard output, the identifier of the served client. If the request arrives when the waiting list is empty, then the program prints zero (0) to the output.

 

 

Sample Input

2
1 20 14
1 30 3
2
1 10 99
3
2
2
0

 

 

Sample Output

0
20
30
10
0

分析：该题的题意要自己去推测，很是无语 - -|

我们要根据测试数据推出code=2是优先级别大的先输出，code=3的是优先级别小的先输出。。。

我使用的方法是map容器，将优先级作为map的关键字，因为map会自动排序

主要注意的一点是删除问题：删除首部可以是elem.earse(elem.begin());然而删除尾部的却不能用elem.earse(elem.rbegin());

删除尾部我是用elem.earse(elem.find((*elem.rbrgin()).first))。

代码如下：

#include <stdio.h>
#include <map>
using namespace std;
int main()
{
	int code,k,p;
	map<int,int> elem;
	while (scanf("%d",&code))
	{
		if(code==0)
			break;
		else if(code==1)
		{
			scanf("%d%d",&k,&p);
			elem[p]=k;
		}
		else if(code==2)
		{
			if(!elem.empty())
			{
				printf("%d/n",(*elem.rbegin()).second);
				elem.erase(elem.find((*elem.rbegin()).first));
			}
			else
				printf("0/n");
		}
		else
		{
			if(!elem.empty())
			{
				printf("%d/n",(*elem.begin()).second);
				elem.erase(elem.begin());
			}
			else
				printf("0/n");
		}
	}
	return 0;
}