Pagini recente » Cod sursa (job #1157104) | Cod sursa (job #2575333) | Cod sursa (job #2590515) | Borderou de evaluare (job #2258045) | Cod sursa (job #1081170)
#include <fstream>
#include <algorithm>
#include <set>
using namespace std;
ifstream fi("heapuri.in");
ofstream fo("heapuri.out");
set<int>h;
int v[200002],n,x,y;
int main() {
fi>>n;int k=0;
for (int i=1;i<=n;i++) {
fi>>x;
if (x==1) {
fi>>y;
h.insert(y);
v[k++]=y;
continue;}
else
if (x==2) {
fi>>y;
h.erase(v[y]);
continue;}
else {
set<int>::iterator it=h.begin();
fo<<*it<<'\n';}}
return 0;}