Pagini recente » Istoria paginii runda/haicatrebuiesatrebuiasca/clasament | Cod sursa (job #1953173) | Istoria paginii runda/haicatrebuiesatrebuiasca/clasament | Cod sursa (job #1518017) | Cod sursa (job #2546655)
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <unsigned int> heap;
vector <unsigned int> poz;
unsigned int m, cod, val;
int main()
{
f >> m;
for (unsigned int i = 1; i <= m; i++)
{
f >> cod;
if (cod == 1)
{
f >> val;
heap.insert(val); // adaug
poz.push_back(val); // retin al catalea a intrat
}
if (cod == 2)
{
f >> val;
heap.erase(poz[val - 1]); // sterg al x-lea element intrat
}
if (cod == 3)
{
g << *heap.begin() << '\n';
}
}
return 0;
}