Pagini recente » Borderou de evaluare (job #2012110) | Cod sursa (job #544644) | Cod sursa (job #411794) | Cod sursa (job #1391627) | Cod sursa (job #429580)
Cod sursa(job #429580)
# include <set>
# include <vector>
using namespace std;
long n,t,x;
set <int> heap;
vector <int> v;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%ld", &n);
for (long i=1;i<=n;++i)
{
scanf("%ld", &t);
if (t==3)
printf("%ld\n", *heap.begin());
else
if (t==1)
{
scanf("%ld", &x);
heap.insert(x);
v.push_back(x);
}
else
{
scanf("%ld", &x);
heap.erase(v[x-1]);
}
}
return 0;
}