Cod sursa(job #3131523)
| Utilizator | Data | 20 mai 2023 14:26:05 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <set>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
vector <int> v, minv;
set <int> s;
int n,x,a,k;
int main() {
f>>n;
for(int i=0; i<n; i++)
{
f>>x;
if(x==3)
{
minv.push_back(*(s.begin()));
}
else
{
f>>a;
if(x==1)
{
s.insert(a);
v.push_back(a);
}
else
{
s.erase(v[a-1]);
}
}
}
for(auto j:minv)
{
g<<j<<endl;
}
return 0;
}
