intvv=tt.second; intsumc=c+cc; if(sumc<disf[vv]){ intt=disf[vv]; disf[vv]=sumc; sumc=t; pq.push(make_pair(disf[vv],vv)); } if(sumc>disf[vv]&&sumc<diss[vv]){ diss[vv]=sumc; pq.push(make_pair(diss[vv],vv)); } } } cout<<diss[n]<<endl; return0; }...
because she likes the scenery along the way. She has decided to take the second-shortest rather than the shortest path. She knows there must be some second-shortest path.