Cod sursa(job #2031091)
Utilizator | Data | 2 octombrie 2017 18:31:16 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
multiset < int > v;
int m[200002];
int n,x,op;
int main()
{
for(in>>n;n;n--)
{
in>>op;
if(op==1)
{
in>>x;
v.insert(x);
m[++m[0]]=x;
}
else if(op==2)
{
in>>x;
v.erase(v.find(m[x]));
}
else if(op==3)
out<<*v.begin()<<'\n';
}
return 0;
}