Cod sursa(job #2623631)
| Utilizator | Data | 3 iunie 2020 15:21:24 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset <int> mul;
multiset <int> :: iterator it;
int n, op, k, x, i;
int v[200010];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>op;
if(op==1){
fin>>x;
v[k]=x;
k++;
mul.insert(x);
}
else if(op==2){
fin>>x;
it=mul.find(v[x-1]);
mul.erase(mul.find(*it));
}
else if(op==3){
it=mul.begin();
fout<<*it<<'\n';
}
}
}
