单源最短路：Dijksra单源最短路，时间复杂度\(O(nlog(n+m))\)不适用于有负权边的图#include<bits/stdc++.h>usingnamespacestd;usingll=longlong;structedge{intto,w;};vector<vector<edge>>adj;vector<int>dis;vector<bool>vis;intn,m,