Cod sursa(job #1288478)
| Utilizator | Data | 8 decembrie 2014 20:57:28 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <set>
#define NMAX 200005
using namespace std;
int n, i, a, b, nr, v[NMAX];
multiset <int> heap;
int main()
{
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
cin>>n;
for(i=1; i<=n; i++)
{
cin>>a;
if(a==1)
{
cin>>v[++nr];
heap.insert(v[nr]);
}
else if(a==2)
{
cin>>b;
heap.erase(heap.find(v[b]));
}
else
cout<<*heap.begin()<<'\n';
}
return 0;
}
