Cod sursa(job #2375853)
Utilizator | Papadia Mortala dacianoua | Data | 8 martie 2019 12:39:38 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <set>
#define nmax 200000
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int v[nmax+5],n;
set<int> h;
int main()
{
fin>>n;
int x,y,z,j=0;
for(int i=1;i<=n;i++)
{
fin>>z;
switch(z)
{
case 1:
fin>>v[++j];
h.insert(v[j]);
break;
case 2:
fin>>x;
h.erase(v[x]);
break;
case 3:
fout<<*h.begin()<<"\n";
}
}
return 0;
}