Cod sursa(job #592912)
Utilizator | Alex Velea veleandu | Data | 31 mai 2011 12:21:07 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<set>
using namespace std;
long n,T[200005];
long tip,val,NrEl,i;
set <int> X;
set <int> :: iterator it;
int main()
{
ifstream in("heapuri.in");
ofstream out("heapuri.out");
in>>n;
for(i=1; i<=n; ++i)
{
in>>tip;
if(tip==1)
{
in>>val;
NrEl++;
T[NrEl]=val;
X.insert(val);
}
if(tip==2)
{
in>>val;
X.erase(T[val]);
}
if(tip==3)
{
it=X.begin();
out<<*it<<"\n";
}
}
return 0;
}