Cod sursa(job #3326425)
| Utilizator | Data | 28 noiembrie 2025 20:25:06 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int> s;
int n,x,g,a[200005],C;
int main()
{ fin>>n;
for(int i=1;i<=n;i++){
fin>>C;
if(C==1){g++;fin>>a[g];s.insert(a[g]);}
else if(C==2){fin>>x;s.erase(s.find(a[x]));}
else fout<<*s.begin()<<"\n";
}
return 0;
}
