Cod sursa(job #2875648)
| Utilizator | Data | 22 martie 2022 08:34:44 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.84 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> s;
map<int,int>m;
int v[200002],k;
int main()
{
int n,p,x;
f>>n;
for (int i=1;i<=n;i++) {f>>p;
if (p==1) {f>>x;
m[x]++;
if (m[x]==1) s.insert(x);
k++;
v[k]=x;
}
if (p==2) {f>>x;
m[v[x]]--;
if (m[v[x]]==0) s.erase(v[x]);
}
if (p==3) {auto it=s.begin();
g<<*it<<'\n';
}
}
}
