1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 | #include <vector>#include <list>#include <map>#include <set>#include <deque>#include <queue>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <ctime>using namespace std;map<int ,int > mp;int main(){ int op; int cus,pri; while(~scanf("%d",&op)) { switch(op){ case 0:return 0; case 1: scanf("%d%d",&cus,&pri); mp[pri] = cus; break; case 2: if(mp.empty()) printf("0\n"); else { map<int ,int >::iterator it = mp.end(); it--; printf("%d\n",it->second); mp.erase(it); } break; case 3: if(mp.empty()) cout<<0<<endl; else { map<int ,int >::iterator it = mp.begin(); printf("%d\n",it->second); mp.erase(it); } break; } } return 0;} |
原文：http://www.cnblogs.com/qhy285571052/p/5142875.html