Pagini recente » Cod sursa (job #689593) | Borderou de evaluare (job #511119) | Diferente pentru blog/probleme-de-formula intre reviziile 18 si 19 | Cod sursa (job #2031091)
#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;
}