Cod sursa(job #1880827)
| Utilizator | Data | 15 februarie 2017 22:25:47 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <stdio.h>
#include <set>
using namespace std;
int n,i,p,x,o[200005],t;
multiset<int> Q;
int main()
{
freopen ("heapuri.in","r",stdin);
freopen ("heapuri.out","w",stdout);
scanf("%i",&n);
while (n--)
{
scanf("%i",&p);
if (p==3) printf("%i\n",*Q.begin());
else
{
scanf("%i",&x);
if (p==1)
{
Q.insert(x);
o[++t]=x;
}
else Q.erase(o[x]);
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
