Pagini recente » Cod sursa (job #334461) | Cod sursa (job #1817197) | Cod sursa (job #1048761) | Cod sursa (job #2154807) | Cod sursa (job #1129261)
#include <fstream>
#include <set>
using namespace std;
const int N = 200002;
int n, a, b, k;
int v[N];
set <int> s;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
f >> n;
for (int i = 1; i <= n; i ++ )
{
f >> a;
if ( a == 3 )
g << *s.begin();
else
{
f >> b;
if ( a == 1 )
{
v[++k] = b;
s.insert(b);
}
else
s.erase(v[b]);
}
}
f.close();
g.close();
return 0;
}