Cod sursa(job #1011642)
Utilizator | Data | 17 octombrie 2013 08:15:53 | |
---|---|---|---|
Problema | Heapuri | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<set>
#include<vector>
#define f cin
#define g cout
#define NM 1200100
using namespace std;
int A[NM],x,t,n,i,k;
set<int> s;
set<int> :: iterator it;
int main ()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
f>>n;
for(i=1;i<=n;++i)
{
f>>t;
if(t==1)
{
f>>x;
A[++k]=x;
s.insert(x);
}
else
if(t==2)
{
f>>x;
it=s.find(A[x]);
s.erase(it);
}
else
{
it=s.begin();
g<<*it<<"\n";
}
}
return 0;
}