Pagini recente » Cod sursa (job #2217694) | Cod sursa (job #1066341) | Cod sursa (job #2227911) | Cod sursa (job #682063) | Cod sursa (job #2896267)
#include <fstream>
#include <set>
using namespace std;
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
unsigned int pozitie[200001], n, poz=1, op, x;
set <unsigned int> heap;
fin >> n;
for (unsigned int i = 0; i < n; i++) {
fin >> op;
switch (op)
{
case 1:
fin >> x;
heap.insert(x);
pozitie[poz++] = x;
break;
case 2:
fin >> x;
heap.erase(pozitie[x]);
break;
case 3:
fout << *(heap.begin()) << "\n";
}
}
fin.close();
fout.close();
return 0;
}