Cod sursa(job #667032)
Utilizator | UAIC-Padurariu-Cristian federer | Data | 22 ianuarie 2012 15:51:25 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<set>
#define Nmax 200001
using namespace std;
set <int> H;
int n, nr, x, v[Nmax], i, tip;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d%",&n);
for(i=1;i<=n;i++)
{
scanf("%d", &tip);
if(tip==1)
{
scanf("%d", &x);
H.insert(x);
v[++nr]=x;
}
else
if(tip==2)
{
scanf("%d", &x);
H.erase(v[x]);
}
else
printf("%d\n", *H.begin());
}
fclose(stdin);
fclose(stdout);
return 0;
}