Pagini recente » Cod sursa (job #2048718) | Cod sursa (job #1621745) | Cod sursa (job #631344) | Cod sursa (job #1462991) | Cod sursa (job #1625076)
#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int v[200003];
int k=1;
int main() {
set<int> q;
int n,a,b;
in >> n;
for(int i = 0; i < n; i++) {
in >> a;
if(a == 1) {
in >> v[k];
q.insert(v[k++]);
} else if(a == 2) {
in >> b;
q.erase(v[b]);
} else
out << *q.begin() << '\n';
}
return 0;
}