Cod sursa(job #2984117)
| Utilizator | Data | 23 februarie 2023 16:53:53 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n, c, nr, v[200005], cnt;
multiset<int> st;
int main()
{
fin>>n;
for (int i = 1; i <= n; i++)
{
fin>>c;
if (c == 1)
{
fin>>nr;
cnt++;
v[cnt] = nr;
st.insert(nr);
}
else if (c == 2)
{
fin>>nr;
st.erase(st.find(v[nr]));
}
else if (c == 3)
{
fout<<*st.begin()<<"\n";
}
}
}