Cod sursa(job #2747355)
| Utilizator | Data | 29 aprilie 2021 00:49:01 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("pariuri.in");
ofstream g("pariuri.out");
set<int> pq;
vector<int> v;
int n,i,operatie,x,nr=0;
int main ()
{
f>>n;
v.assign(200001,0);
for(i=0;i<n;i++)
{
f>>operatie;
if(operatie==1)
{
f>>x;
pq.insert(x);
v[++nr]=x;
}
else if(operatie==3)
{
g<<*pq.begin()<<'\n';
}
else if(operatie==2)
{
f>>x;
pq.erase(v[x]);
}
}
return 0;
}
