Cod sursa(job #2267147)
Utilizator | Data | 23 octombrie 2018 12:39:48 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("heapuri.in");
ofstream out ("heapuri.out");
int n, cod, x, v[200005], nr;
multiset <int> myset;
int main()
{
in >> n;
for (int i=1; i<=n; i++)
{
in >> cod;
if (cod==1)
{
in >> x;
myset.insert(x);
nr++;
v[nr]=x;
}
else
if (cod==2)
{
in >> x;
myset.erase(myset.find(v[x]));
}
else
{
auto it=myset.begin();
out << *it << '\n';
}
}
return 0;
}