Cod sursa(job #3324482)
| Utilizator | Data | 22 noiembrie 2025 11:24:43 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int>s;
vector<int>v;
int n,c,x;
int main()
{
fin>>n;
v.push_back(0);
for(int i=1;i<=n;i++)
{
fin>>c;
if(c==1)
{
fin>>x;
v.push_back(x);
s.insert(x);
}
if(c==2)
{
fin>>x;
s.erase(s.find(v[x]));
}
if(c==3)
{
fout<<*s.begin()<<'\n';
}
}
return 0;
}
