Cod sursa(job #977428)
| Utilizator | Data | 25 iulie 2013 20:51:54 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,v[200010];
multiset<int> S;
int main(void){
register int i,j,x,y,k=0;
f>>n;
for(i=1;i<=n;i++){
f>>x;
if(x==1)
f>>y,v[++k]=y,S.insert(v[k]);
else if(x==2){
f>>y,S.erase(v[y]);
}
else
g<<*S.begin()<<"\n";
}
f.close();
g.close();
return 0;
}
