Pagini recente » Cod sursa (job #2244879) | Arhiva de probleme | Istoria paginii runda/bbb | Teoria jocurilor | Cod sursa (job #696869)
Cod sursa(job #696869)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
#define zz 200001
int a[zz],nr;
multiset <int> sega;
multiset <int> :: iterator it;
int main()
{
int n,k,x;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>k;
if(k!=3) f>>x;
if(k==1)
{
a[++nr]=x;
sega.insert(x);
}
if(k==2)
{
sega.erase(sega.find(a[x]));
}
if(k==3)
{
it=sega.begin();
g<<*it<<'\n';
}
}
f.close();
g.close();
return 0;
}