Cod sursa(job #3297326)
Utilizator | Data | 22 mai 2025 14:14:07 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
multiset <int> st;
vector <int> intrati;
int main() {
ifstream fin( "heapuri.in" );
ofstream fout( "heapuri.out" );
int n;
fin >> n;
for ( int i = 1, tip, x; i <= n; i ++ ) {
fin >> tip;
if ( tip == 1 ) {
fin >> x;
intrati.push_back( x );
st.insert( x );
} else if ( tip == 2 ) {
st.erase( intrati[x - 1] );
} else {
fout << (*st.begin()) << '\n';
}
}
return 0;
}