Pagini recente » Borderou de evaluare (job #1569435) | Cod sursa (job #2807541) | Cod sursa (job #1240269) | Cod sursa (job #80934) | Cod sursa (job #2646241)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream o("heapuri.out");
set<int>v;
int pos[200005];
int n, k;
int x, j;
int main()
{
f >> n;
for (size_t i = 0; i < n; i++)
{
f >> k;
switch (k)
{
case 1:
f >> x;
v.insert(x);
pos[++j] = x;
break;
case 2:
f >> x;
v.erase(pos[x]);
break;
case 3:
o << *v.begin();
break;
default:
break;
}
}
}