Cod sursa(job #1710588)
| Utilizator | Data | 29 mai 2016 12:39:03 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int> s;
set<int> ::iterator ii;
int c,v[200010],x,i,k,n;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>c;
if(c==1)
{
f>>x;
v[++k]=x;
s.insert(x);
}
else
{
if(c==2)
{
f>>x;
s.erase(v[x]);
}
else if(c==3)
{
g<<*s.begin()<<'\n';
}
}
}
return 0;
}
