Pagini recente » Cod sursa (job #407470) | Cod sursa (job #197815) | Cod sursa (job #2986704) | Borderou de evaluare (job #3146052) | Cod sursa (job #2965939)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
int v[200005];
int k;
multiset <int> q;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
int t;
fin>>t;
if(t==1)
{
++k;
fin>>v[k];
q.insert(v[k]);
}
else if (t==2)
{
int x;
fin>>x;
q.erase(q.find(v[x]));
}
else
fout<<*q.begin()<<'\n';
}
}