Cod sursa(job #1319725)
| Utilizator | Data | 17 ianuarie 2015 13:06:04 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
multiset<int> s;
vector<int> v;
int main(){
int n,t,x;
v.push_back(-1);
for(in>>n;n;n--)
{
in>>t;
if(t==1){
in>>x;
s.insert(x);
v.push_back(x);
}
else if(t==2){
in>>x;
s.erase(s.find(v[x]));
}
else out<<*s.begin()<<'\n';
}
return 0;
}
