poj 3481 double queues

 1
 2    
 3    /* ***********************************************
 4    Author :111qqz
 5    Created Time :2016年02月19日 星期五 15时44分06秒
 6    File Name :3481.cpp
 7    ************************************************ */
 8    
 9    #include <algorithm>
10    #include <cstdio>
11    #include <iostream>
12    #include <cstring>
13    #include <string>
14    #include <cmath>
15    #include <map>
16    #include <stack>
17    #include <queue>
18    
19    using namespace std;
20    typedef long long LL;
21    const int inf = 8E8;
22    
23    
24    
25    int cmd;
26    map<int,int>a;
27    int p,k;
28    
29    int main()
30    {
31    
32        while (scanf("%d",&cmd)!=EOF&&cmd)
33        {
34           if (cmd==1)
35           {
36               scanf("%d %d",&k,&p);
37               a[p]=k;
38           }
39           if (cmd==2)
40           {
41               if (a.empty())
42               {
43                   cout<<"0"<<endl;
44               }
45               else
46               {
47                   cout<<a.rbegin()->second<<endl;
48                   a.erase(a.find(a.rbegin()->first));
49               }
50           }
51           if ( cmd==3 )
52           {
53               if (a.empty())
54               {
55                   cout<<"0"<<endl;
56               }
57               else
58               {
59                   cout<<a.begin()->second<<endl;
60                   a.erase(a.begin());
61               }
62           }
63        }
64    
65    	return 0;
66    }
67    
68
69