Cod sursa(job #3286178)
| Utilizator | Data | 13 martie 2025 19:46:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int> ms;
vector<int> v;
int main()
{
int n, q;
fin >> n;
while(n--)
{
int a;
fin >> q;
if(q==1)
{
fin >> a;
v.push_back(a);
ms.insert(a);
}
else if(q==2)
{
fin >> a;
ms.erase(ms.find(v[a-1]));
}
else
fout << *ms.begin() << '\n';
}
return 0;
}
