Cod sursa(job #857669)
Utilizator | Data | 18 ianuarie 2013 10:08:02 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
# include <set>
using namespace std;
std::multiset<int> s;
int n,op,i,x,v[200110],n1;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d\n",&n);
n1=0;
for (i=1; i<=n; i++)
{
scanf("%d ",&op);
if (op==1)
{
scanf("%d\n",&v[++n1]);
s.insert(v[n1]);
}
if (op==2)
{
scanf("%d\n",&x);
s.erase(s.find(v[x]));
}
if (op==3)
{
printf("%d\n",*s.begin());
}
}
return 0;
}