Cod sursa(job #1663165)
| Utilizator | Data | 25 martie 2016 16:22:46 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N_max = 200005;
int v[N_max];
int K;
set <int> H;
int N;
int main()
{
int T, x;
in >> N;
for(int i = 1; i <= N; i++)
{
in >> T;
if(T == 1)
{
in >> x;
H.insert(x);
v[++K] = x;
}
else
{
if(T == 2)
{
in >> x;
H.erase(v[x]);
}
else
out << *H.begin() << '\n';
}
}
return 0;
}
