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