Cod sursa(job #1450170)
| Utilizator | Data | 11 iunie 2015 19:05:52 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,c,i,V[200010],t,x;
set<int> M;
int main()
{
f>>n;
for(;n;n--)
{
f>>c;
if(c==1)
{
t++;
f>>V[t];
M.insert(V[t]);
}
else
if(c==2)
{
f>>x;
M.erase(V[x]);
}
else
{
set<int>::iterator it=M.begin();
g<<*it<<'\n';
}
}
return 0;
}
