Cod sursa(job #2550266)
Utilizator | Galatanu Bogdan Ioan Galatanu_Bogdan | Data | 18 februarie 2020 17:45:34 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
#include <set>
#define NMAX 200001
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int order[NMAX],n,t,x,orders;
multiset <int> my_set;
int main()
{
in>>n;
for(int i=1;i<=n;++i)
{
in>>orders;
if(orders == 1)
{
in>>x;
my_set.insert(x);
t++;
order[t] = x;
}
if(orders == 2)
{
in>>x;
x = order[x];
my_set.erase(x);
}
if(orders == 3)
{
multiset<int>::iterator it;
it = my_set.begin();
out<<*it<<'\n';
}
}
}