Cod sursa(job #2742583)
| Utilizator | Data | 21 aprilie 2021 10:53:11 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, optiune;
multiset <int> s;
vector <int> vect;
void cit()
{
f>>n;
int nr;
for(int i=1; i<=n; i++)
{
f>>optiune;
if(optiune==3)
{
g<<(*s.begin())<<"\n";
}
else
{
f>>nr;
if(optiune==1)
{
s.insert(nr);
vect.push_back(nr);
}
else
{
int j=vect[nr-1];
s.erase(j);
}
}
}
}
int main()
{
cit();
return 0;
}
