Cod sursa(job #1689881)

Utilizator Evghenii_BeriozchinEvghenii Beriozchin Evghenii_Beriozchin Data 14 aprilie 2016 16:59:06
Problema Heapuri Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <bits/stdc++.h>

using namespace std;


int main()
{ set<int> a;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int q[200005] , nr=0, n;
fin>>n;
int x,b;
   for(int i=0; i<n; i++){
    fin>>x;
    if (x==1) {fin>>b; q[nr++]=b; a.insert(b);}
    if (x==2) {fin>>b; a.erase(a.find(q[b-1]));}
    if (x==3) fout<<*(a.begin());

   }

    return 0;
}