Cod sursa(job #1369845)
Utilizator | Data | 3 martie 2015 11:46:02 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int N, x, a[200005], tip, nr;
set < int > H;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
{
f>>tip;
if (tip==1) f>>x, a[++nr]=x, H.insert(x);
else if (tip==2) f>>x, H.erase(a[x]);
else g<<*H.begin()<<'\n';
}
return 0;
}