Cod sursa(job #1129265)
Utilizator | Vlad Zuga vlad96 | Data | 27 februarie 2014 21:03:23 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#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() << '\n';
else
{
f >> b;
if ( a == 1 )
{
v[++k] = b;
s.insert(b);
}
else
s.erase(v[b]);
}
}
f.close();
g.close();
return 0;
}