Pagini recente » Cod sursa (job #2665386) | Cod sursa (job #1311495) | Cod sursa (job #2816866) | Cod sursa (job #631180) | Cod sursa (job #1269340)
#include<fstream>
#include<set>
using namespace std;
int v[200001],k2,k3=1;
int main()
{
ifstream fcin("heapuri.in");
ofstream fcout("heapuri.out");
multiset <int> heap;
multiset <int> :: iterator k;
int n,i,x,y,nr;
fcin>>n;
for(i=1;i<=n;i++)
{
fcin>>x;
if(x!=3)fcin>>y;
if(x==1)
{
heap.insert(y);
v[++k2]=y;
}
else if(x==3)
{
k=heap.begin();
fcout<<*k;
}
else
{
k3++;
heap.erase(heap.find(v[k3]));
}
}
return 0;
}