Pagini recente » Cod sursa (job #1576033) | Cod sursa (job #753973) | Cod sursa (job #1494944) | Cod sursa (job #1784269) | Cod sursa (job #2422079)
#include <fstream>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
#define maxn 200000
#define maxn1 2000000000
int heap[maxn],N,o,x,poz=0,mi=maxn1,poz2;
int main()
{
heap[0]=maxn1;
cin>>N;
for(int i=1; i<=N; i++){
cin>>o;
if(o==3){
if(heap[poz2]==maxn1){
mi=maxn1;
for(int j=1; j<=poz; j++)
if(heap[j]<mi){
mi=heap[j];
poz2=j;
}
}
cout<<mi<<'\n';
}else if(o==2){
cin>>x;
heap[x]=maxn1;
}
else {
cin>>x;
heap[++poz]=x;
if(x<mi){
mi=x;
poz2=poz;
}
}
}
return 0;
}