Pagini recente » Istoria paginii runda/r22009 | Cod sursa (job #1956048) | Cod sursa (job #2286918) | Cod sursa (job #334476) | Cod sursa (job #2907046)
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
set<int> s;
int h[200000];
int op,N, nr;
long k = 0;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>N;
for(int i=1;i<=N;i++){
f>>op;
if(op== 1){
f>>nr;
h[k++] = nr;
s.insert(nr);
}
else if(op==2 ){
f>>nr;
int x = h[nr-1 ];
s.erase(x);
}
else if(op== 3){
g<<*s.begin()<<endl;
}
}
f.close();
g.close();
return 0;
}