Cod sursa(job #2200674)
Utilizator | Data | 2 mai 2018 09:47:52 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#define NMAX 200005
using namespace std;
set <int> heap;
int n,poz[NMAX],k,a,x;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int main()
{in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
if(x==1)
{ in>>a;
heap.insert(a);
poz[++k]=a;
}
else if(x==2)
{
in>>a;
heap.erase(poz[a]);
}
else out<<*heap.begin()<<'\n';
}
return 0;
}