Cod sursa(job #1711965)
| Utilizator | Data | 1 iunie 2016 17:54:35 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <set>
using namespace std;
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set<int> heap;
int n,op,nr,v[200005],nV=1;
fin>>n;
for(int i=1;i<=n;i++) {
fin>>op;
if(op==1) {
fin>>nr;
heap.insert(nr);
v[nV]=nr,nV++;
}
else if(op==2) {
fin>>nr;
heap.erase(v[nr]);
}
else
fout<<*heap.begin()<<'\n';
}
return 0;
}
