Cod sursa(job #857419)
| Utilizator | Data | 17 ianuarie 2013 20:14:06 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset <int> myset;
std :: set <int> :: iterator it;
int i,n,x,y,a[200001],nr;
int main ()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>x;
if (x==1)
{
f>>a[++nr];
myset.insert(a[nr]);
}
else
if (x==2)
{
f>>y;
myset.erase(myset.find(a[y]));
}
else
{
it=myset.begin();
g<<*it<<'\n';
}
}
return 0;
}
