Pagini recente » Cod sursa (job #2034050) | Cod sursa (job #1610401) | Istoria paginii runda/jc2015-runda1/clasament | Cod sursa (job #1752090) | Cod sursa (job #1164299)
#include <cstdio>
#include <set>
using namespace std;
#define FILEIN "heapuri.in"
#define FILEOUT "heapuri.out"
#define NMAX 200005
int A[NMAX], T, x, N, k = 0; set<int> Heap;
int main() {
freopen(FILEIN, "r", stdin);
freopen(FILEOUT, "w", stdout);
for ( scanf("%d", &N); N; N-- ) {
scanf("%d", &T);
if (T == 3) {
printf("%d\n", *Heap.begin());
continue;
}
scanf("%d", &x);
if (T == 1) {
Heap.insert(x);
A[++k] = x;
}
if (T == 2) {
Heap.erase(Heap.find(A[x]));
}
}
return 0;
}