Cod sursa(job #1365564)
| Utilizator | Data | 28 februarie 2015 13:05:36 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
set<int> v;
int nrint, intrat[200001];
int main()
{
int i,tip,x;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>tip;
if(tip == 1)
{
fin>>x;
v.insert(x);
intrat[++nrint] = x;
}
else
if(tip == 2)
{
fin>>x;
v.erase(intrat[x]);
}
else
{
fout<<*v.begin()<<'\n';
}
}
fin.close(); fout.close();
return 0;
}
