Cod sursa(job #2182114)
Utilizator | Mihai-Cristian Popescu mihai50000 | Data | 22 martie 2018 09:57:48 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
const int NMAX = 200010;
set <int> MySet;
int a[NMAX], dr;
int main()
{
int c, x, n;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> c;
if (c == 1)
{
f >> x;
MySet.insert(x);
a[++dr] = x;
}
else
if (c == 2)
{
f >> x;
MySet.erase(a[x]);
}
else
g << *MySet.begin() << '\n';
}
}