Cod sursa(job #3286111)
| Utilizator | Data | 13 martie 2025 18:50:57 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
vector<int> v;
multiset<int> mts;
int main()
{
int n,i,tip,x;
fin>>n;
for(i=1;i<=n;++i)
{
fin>>tip;
if(tip==1)
{
fin>>x;
v.push_back(x);
mts.insert(x);
}
else if(tip==2)
{
fin>>x;
auto it=mts.find(v[x-1]);
mts.erase(it);
}
else if(tip==3)
{
fout<<*mts.begin()<<'\n';
}
}
return 0;
}
