Cod sursa(job #1410841)
Utilizator | Vlad Stoleru vlad00 | Data | 31 martie 2015 12:14:06 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <set>
#define NMAX 200001
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset<int>s;
long long n,i,tip,x;
long long nrint,intrat[NMAX];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>tip;
if(tip==1)
{
f>>x;
s.insert(x);
intrat[++nrint]=x;
}
else
if(tip==2)
{
f>>x;
s.erase(intrat[x]);
}
else
g<<*s.begin()<<'\n';
}
f.close();
g.close();
return 0;
}