Hdu 5349 MZL's simple problem (水题)

解析：用一个multiset维护一下就好。

[code]:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdlib>
#include<set>

using namespace std;

int n;
multiset<int> ms;
multiset<int>::iterator it;

void init(){
    ms.clear();
}

int main(){
    int i,j,cas,op,x;
    while(~scanf("%d",&n)){
        init();
        while(n--){
            scanf("%d",&op);
            if(op==1) scanf("%d",&x);
            if(op==1) ms.insert(x);
            if(op==2&&!ms.empty()) ms.erase(ms.begin());
            if(op==3){
                if(ms.empty()) printf("0\n");
                else{
                    it = ms.end();--it;
                    printf("%d\n",*it);
                }
            }
        }
    }
    return 0;
}