Pagini recente » Cod sursa (job #2309575) | Cod sursa (job #2433093) | Cod sursa (job #2388906) | Cod sursa (job #1422960) | Cod sursa (job #1041370)
#include <set>
#include <cstdio>
using namespace std;
int i, A[200001], N, Nr, X, j;
multiset<int> H;
int main()
{
freopen("heapuri.in", "r", stdin);
freopen("heapuri.out", "w", stdout);
scanf("%d", &N);
for (i=1; i<=N; i++)
{
scanf("%d", &j);
if (j==1)
{
scanf("%d", &X);
H.insert(X);
A[++Nr]=X;
}
else
if (j==2)
{
scanf("%d", &X);
H.erase( H.find(A[X]) );
}
else printf("%d\n", *H.begin() );
}
return 0;
}