Cod sursa(job #2884142)

Utilizator VipioanaMirea Oana Teodora Vipioana Data 2 aprilie 2022 14:21:50
Problema Heapuri Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
const int N=1e3+1;
int n,cnt,nh,v[N],h[N],poz[N];

void schimb(int p, int q){
    swap(h[p],h[q]);
    poz[h[p]]=p;
    poz[h[q]]=q;
}

void urca(int p){
    while(v[h[p]]<v[h[p/2]]){
        schimb(p,p/2);
        p/=2;
    }
}

void adauga(int val){
    h[++nh]=val;
    urca(nh);
}

void coboara(int p){
    int fs=2*p,fd=2*p+1,bun=p;
    if(fs<=nh && v[h[fs]]<v[h[bun]])
        bun=fs;
    if(fd<=nh && v[h[fd]]<v[h[bun]])
        bun=fd;
    if(bun!=p){
        schimb(p,bun);
        coboara(bun);
    }
}

void sterge(int p){
    if(p==nh)
        nh--;
    else{
        schimb(p,nh--);
        urca(p);
        coboara(p);
    }
}

int main()
{
    cin>>n;
    for(int i=1; i<=n; i++){
        int c;
        cin>>c;
        if(c==1){
            cin>>v[++cnt];
            poz[cnt]=cnt;
            adauga(cnt);
        }else
            if(c==2){
                int x;
                cin>>x;
                sterge(poz[x]);
            }
        else
        cout<<v[h[1]]<<'\n';
    }
    return 0;
}