Cod sursa(job #1508977)
Utilizator | Data | 23 octombrie 2015 12:41:51 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int v[100001],n,op,nr,k;
set<int>a;
int main()
{
f>>n;
while(n)
{
n--;
f>>op;
if(op==3)
g<<*a.begin()<<"\n";
else if(op==1)
{
f>>nr;
k++;
a.insert(nr);
v[k]=nr;
}
else if(op==2)
{
f>>nr;
a.erase(v[nr]);
}
}
return 0;
}