Pagini recente » Cod sursa (job #1888673) | Cod sursa (job #3143090) | Cod sursa (job #2800019) | Cod sursa (job #1387582) | Cod sursa (job #1424063)
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset <int> h;
int v[200001],k,n,x,y,i;
int main()
{//h.insert(x)
//h.eras`e(h.find(v[k]))
f>>n;
for(i=1;i<=n;i++){
f>>x;
if(x==1)
{
f>>y;
h.insert(y);
v[++k]=y;
}
else{
if(x==2){
f>>y;
h.erase(h.find(v[y]));
v[++k]=y;
}
else{
g<<*h.begin()<<'\n';}
}}
return 0;
}