Cod sursa(job #1964768)
| Utilizator | Data | 13 aprilie 2017 17:38:53 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int qs;
set<int> SET;
vector<int> EL;
void solve(){
for(int i=1,x,y;i<=qs;i++){
in>>x;
if(x==1){
in>>y;
SET.insert(y);
EL.push_back(y);
}
else if(x==2){
in>>y;
SET.erase(EL[y-1]);
}
else{
out<<*SET.begin()<<"\n";
}
}
}
int main(){
in>>qs;
solve();
return 0;
}
