Pagini recente » Cod sursa (job #1345582) | Cod sursa (job #1324278) | Cod sursa (job #922419) | Cod sursa (job #1017037) | Cod sursa (job #820799)
Cod sursa(job #820799)
#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
const int N = 210000;
int n, a[N], e, nr, op;
multiset<int> s;
int main() {
int i;
freopen("heapuri.in", "r", stdin);
freopen("heapuri.out", "w", stdout);
cin >> n;
for(i = 1; i<=n; ++i) {
cin >> op;
if(op == 1) {
cin >> e;
a[++nr] = e;
s.insert(e);
}
if(op == 2) {
cin >> e;
s.erase(s.find(a[e]));
}
if(op == 3)
cout << *s.begin() << "\n";
}
return 0;
}