poj3481——Double Queue

map应用！

map网上详细讲解地址：

http://www.kuqin.com/cpluspluslib/20071231/3265.html

http://mxdxm.javaeye.com/blog/518571

http://weihuachao1984.blog.163.com/blog/static/328712862008102411386264/

#pragma warning (disable:4786) #include<cstdio> #include<iostream> #include<map> using namespace std; map<int,int> M; int n,name,number; int main() { while(scanf("%d",&n)!=EOF) { if(n==0) break; if(n==1) { scanf("%d%d",&name,&number); M.insert(pair<int,int>(number,name)); } else if(n==2) { if(M.empty()) printf("0/n"); else { printf("%d/n",M.rbegin()->second ); M.erase (M.find (M.rbegin()->first )); } } else if(n==3) { if(M.empty ()) printf("0/n"); else { printf("%d/n",M.begin ()->second ); M.erase (M.begin() ); } } } return 0; }