Pagini recente » Cod sursa (job #3287238) | Cod sursa (job #2911933) | Cod sursa (job #2487108) | Cod sursa (job #482580) | Cod sursa (job #1646357)
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#define NMax 200005
#define mod 1999999973
#define INF 0x3f3f3f3f
using namespace std;
int n,m,p,x,y,nr;
set<int> H;
int ord[NMax];
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(int i = 1; i <= n; ++i){
scanf("%d",&p);
if(p == 1){
scanf("%d",&x);
ord[++nr] = x;
H.insert(x);
}
if(p == 2){
scanf("%d",&x);
H.erase(ord[x]);
}
if(p == 3){
printf("%d\n",(*H.begin()));
}
}
return 0;
}