Pagini recente » Cod sursa (job #334303) | Cod sursa (job #1341102) | Cod sursa (job #1240716) | Cod sursa (job #1094781) | Cod sursa (job #1006692)
#include <fstream>
#include <set>
const int maxn=200010;
using namespace std;
set <int>h;
int ord[maxn],c, n,cnt,x;
int main()
{
int i;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>n;
for(i=0;i<n;i++)
{
f>>c;
if(c<=2)
f>>x;
switch(c)
{
case 1:{ h.insert(x);ord[cnt]=x;cnt++;break;};
case 2:{ h.erase(ord[x-1]);break;};
case 3:{ set <int> :: iterator it = h.end(); --it; g<<*it<<"\n"; break;};
}
}
}