Cod sursa(job #3295931)
Utilizator | Data | 9 mai 2025 19:45:43 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int a[200005], k;
multiset<int> M;
multiset<int> :: iterator it;
int main()
{
int i, m, op, x;
fin >> m;
while(m)
{
fin >> op;
if(op < 3)
{
fin >> x;
if(op == 1)
{
k++;
a[k] = x;
M.insert(x);
}
else{
it = M.find(a[x]);
M.erase(it);
}
}
else fout << *M.begin() << "\n";
m--;
}
fout.close();
return 0;
}