Cod sursa(job #1376280)
Utilizator | Stoiean Tudor tudor00 | Data | 5 martie 2015 16:52:48 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
long long n,i,tip,x;
multiset <int> v;
int nrint,intrat[200001];
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>tip;
if(tip == 1)
{
in>>x;
v.insert(x);
intrat[++nrint] = x;
}
else
if(tip == 2)
{
in>>x;
v.erase(intrat[x]);
}
else
{
out<<*v.begin()<<'\n';
}
}
in.close();
out.close();
return 0;
}