Cod sursa(job #1723132)
Utilizator | Data | 29 iunie 2016 19:32:40 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream si("heapuri.in");
ofstream so("heapuri.out");
multiset<int> val;
int x[200005];
int main()
{
int q;
si>>q;
int a,b,cont=0;
while(q--)
{
si>>a;
if(a==1)
{
si>>b;
x[cont]=b;
++cont;
val.insert(b);
}
else
{
if(a==2)
{
si>>b;
--b;
val.erase(val.find(x[b]));
}
else
{
cout<<*(val.begin())<<'\n';
}
}
}
return 0;
}