Pagini recente » Cod sursa (job #400516) | Borderou de evaluare (job #1569756) | Borderou de evaluare (job #299076) | Cod sursa (job #2411282) | Cod sursa (job #499905)
Cod sursa(job #499905)
#include <stdio.h>
#include <set>
using namespace std;
set<long> heap;
long i,n,sw,x,v[200002],m;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%ld",&n);
m=0;
for(i=1;i<=n;i++)
{
scanf("%ld",&sw);
if(sw==1)
{
scanf("%ld",&v[++m]);
heap.insert(v[m]);
}
else
if(sw==2)
{
scanf("%ld",&x);
heap.erase(v[x]);
}
else
if(sw==3) printf("%ld\n",*heap.begin());
}
return 0;
}