Pagini recente » Cod sursa (job #2620112) | Cod sursa (job #962430) | Cod sursa (job #1724771) | Cod sursa (job #967856) | Cod sursa (job #2747997)
#include <iostream>
#include <fstream>
#include <set>
#define N 200001
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
set <int> h;
int poz[N], n, m;
int main()
{
int operatie, x;
fin >> n;
m = 0;
for ( int i = 0; i < n; i++ )
{
fin >> operatie;
if ( operatie == 1 ) // inserare
{
fin >> x;
h.insert(x);
m++;
poz[m] = x;
}
else
if ( operatie == 2 ) // stergere
{
fin >> x;
h.erase(poz[x]);
}
else
if ( operatie == 3 ) // afisare
{
fout << *(h.begin());
fout << "\n";
}
}
return 0;
}