Pagini recente » Cod sursa (job #1905491) | Cod sursa (job #586894) | Cod sursa (job #348787) | Cod sursa (job #2972786) | Cod sursa (job #1917974)
#include <fstream>
#include <set>
#define ma 200002
using namespace std;
int n,x=0,k,c;int v[ma];
multiset <int> heap;
multiset <int> :: iterator p;
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>c;
if(c==3)
{
p=heap.begin();
fout<<*p<<"\n";
}
else
{
if(c==1)
{
fin>>v[++x];
heap.insert(v[x]);
}
else
{
fin>>k;
p=heap.find(v[k]);
heap.erase(*p);
}
}
}
return 0;
}