Cod sursa(job #3289441)
Utilizator | Data | 26 martie 2025 20:38:29 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,op,x,k,v[200200];
multiset <int> st;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>op;
if(op==1)
f>>x, st.insert(x), v[++k]=x;
if(op==2)
f>>x, st.erase(st.lower_bound(v[x]));
if(op==3)
g<<(*st.begin())<<'\n';
}
return 0;
}