Cod sursa(job #2130681)
Utilizator | Data | 13 februarie 2018 20:27:02 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset < int > m;
vector < int > v;
int n,cerinta,x;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>cerinta;
if(cerinta==1)
{
f>>x;
v.push_back(x);
m.insert(x);
}
else if(cerinta==2)
{
f>>x;
m.erase(m.find(v.at(x-1)));
}
else g<<*m.begin()<<'\n';
}
return 0;
}