Cod sursa(job #2501036)
Utilizator | Data | 28 noiembrie 2019 23:41:10 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset <int> s;
int n,i,tip,v[200002],x,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++){
fin>>tip;
if(tip==1){
fin>>x;
v[++k]=x;
s.insert(x);
}
if(tip==2){
fin>>x;
s.erase(v[x]);
}
else{
fout<<*s.begin()<<"\n";
}
}
}