Cod sursa(job #2586936)
| Utilizator | Data | 21 martie 2020 19:22:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <set>
#define Nmax 200011
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n,v[Nmax],nr;
set <int> heap;
int main()
{
int i,a,b;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a;
if (a==1)
fin>>b,v[++nr]=b,heap.insert(b);
if (a==2)
fin>>b,heap.erase(v[b]);
if (a==3)
fout<<*heap.begin()<<"\n";
}
return 0;
}
