acm 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

分析：在我看来这题真的是难在读懂题意，假如以前没有做过这类题，那么你要理解题意就难了……

或者可以换种说法，它给出的输出样例可以看出些东东来，而上面的描述到更是让人难以理解题意。

那么我接下来我就说说这题要我们做什么~

通熟的说，每一行都有一个数来告诉我们要做的事情（原文中体现在Each line of the input contains

 one of the possible requests。）。当输入的第一个为2或3时，就是要就输出，1时就要们添加

一个request，要求按照优先级排列（及按照P的大小排序，因此我们很自然的想到map容器，有自动

排序的功能）。当输入的时2时输出优先级最高的键值，3时输出优先级最低的键值。

明白了要做的东西就好下手了，根本不要管他题目怎么说的了，也就是们只要知道怎么对输入的这些数据

处理就足够了~

#include<iostream>
#include<string>
#include<map>
#include<stdio.h>
using namespace std;

int main()
{
	int n,k,p;
	map<int,int> L;
//	map<int,int>::iterator it;
	while(scanf("%d",&n)&&n!=0)
	{
		if(n==1)
		{		
			scanf("%d%d",&k,&p);
			L[p]=k;	//按优先级自动排序
		}
		else if(n==2)
		{
			if(L.empty())
				cout<<"0"<<endl;
			else
			{
				cout<<L.rbegin()->second<<endl;
				L.erase(L.rbegin()->first);
			}
		}
		else
		{
			cout<<L.begin()->second<<endl;
			L.erase(L.begin());
		}
	}
	return 0;
}