{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cstyle type\u003d\"text/css\"\u003e .sampledata { font-family: \"Courier New\", Courier, monospace; white-space: pre; }\u003c/style\u003e\u003cdiv\u003e\n 给出一个N个点M条边的无向图,经过一个点的代价是进入和离开这个点的两条边的边权的较大值,求从起点1到点N的最小代价。起点的代价是离开起点的边的边权,终点的代价是进入终点的边的边权\n\u003c/div\u003e \n\u003cdiv\u003e\n N\u0026lt;\u003d100000\n\u003c/div\u003e \n\u003cdiv\u003e\n M\u0026lt;\u003d200000\n\u003c/div\u003e \n\u003cdiv\u003e\u003c/div\u003e \n\u003cdiv\u003e\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e\u003c/div\u003e \n\u003cdiv\u003e\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e\u003c/div\u003e \n\u003cdiv\u003e\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cspan class\u003dsampledata\u003e4 5\r\n1 2 5\r\n1 3 2\r\n2 3 1\r\n2 4 4\r\n3 4 8\u003c/span\u003e\u003c/div\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cspan class\u003dsampledata\u003e12\u003c/span\u003e\u003c/div\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cp\u003e\u003c/p\u003e\n\u003cp\u003e\u003c/p\u003e\n\u003cbr\u003e \n\u003cp\u003e\u003c/p\u003e\n\u003cp\u003e\u003c/p\u003e"}}]}