这一题用map, multiset, priority_queue直接模拟都可以。注意每一个test case里可能输入多个N,之前因为这个TLE了。另外,因为题目只要输出最大值,可以直接在输入的时候记录最大值,在删除完之后Max=-INF。并在删除时记录元素个数,以便等于0时特判。
multiset
#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<stdlib.h>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<ctype.h>
#include<map>
#include<time.h>
#include<bitset>
#include<set>
#include<list>
using namespace std;
//hdu 5349
const int maxn=110;
multiset<int>s;
int op;
int x;
int N;
multiset<int>::iterator iter;
int main()
{
freopen("input.txt","r",stdin);
while(scanf("%d",&N)!=EOF)
{
s.clear();
for(int ca=1;ca<=N;ca++)
{
scanf("%d",&op);
if(op==1)
{
scanf("%d",&x);
s.insert(x);
}
else if(op==2)
{
if(s.empty())
{
continue;
}
iter=s.begin();
s.erase(iter);
}
else if(op==3)
{
if(s.empty())
{
printf("0\n");
continue;
}
iter=s.end();
iter--;
printf("%d\n",*iter);
}
}
}
return 0;
}
map
#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<stdlib.h>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<ctype.h>
#include<map>
#include<time.h>
#include<bitset>
#include<set>
#include<list>
using namespace std;
//hdu 5349
const int maxn=110;
map<int,int>mapt;
int op;
int x;
int N;
map<int,int>::iterator iter;
int main()
{
// freopen("input.txt","r",stdin);
while(scanf("%d",&N)!=EOF)
{
mapt.clear();
for(int ca=1;ca<=N;ca++)
{
scanf("%d",&op);
if(op==1)
{
scanf("%d",&x);
mapt[x]=1;
}
else if(op==2)
{
if(mapt.empty())
{
continue;
}
iter=mapt.begin();
mapt.erase(iter);
}
else if(op==3)
{
if(mapt.empty())
{
printf("0\n");
continue;
}
iter=mapt.end();
iter--;
printf("%d\n",iter->first);
}
}
}
return 0;
}