Cod sursa(job #2748120)
| Utilizator | Data | 29 aprilie 2021 22:39:38 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.9 kb |
#include <fstream>
#include <vector>
#include <set>
using namespace std;
int n, x, y;
vector <int> v;
set <int> heap;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
void adaugare(int x)
{
heap.insert(x);
v.push_back(x);
}
void stergere(int x)
{
heap.erase(v[x-1]);
}
int minim(set <int> heap)
{
return *heap.begin();
}
int main()
{
f>>n;
while(n)
{
f>>x;
n--;
switch(x)
{
case 1:
{
f>>y;
adaugare(y);
break;
}
case 2:
{
f>>y;
stergere(y);
break;
}
case 3:
{
g<<minim(heap)<<endl;
break;
}
}
}
f.close();
g.close();
}
