{"trustable":false,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"给定N个路由器安装点,接下来的N个数字表示在某地安装一个接口的费用。再接下来N*N的矩阵表示两地进行连接时的花费。但是要想建立两点的链接,还要在两点安装接口。求最小生成树。"}},{"title":"Input","value":{"format":"HTML","content":"T组输入。\n保证所有数字不超过1000。"}},{"title":"Output","value":{"format":"HTML","content":"每组输出一个结果"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003c/b\u003e\u003c/p\u003e \n \u003cp\u003e1\u003cbr\u003e 3\u003cbr\u003e 10 20 30\u003cbr\u003e 0 100 200\u003cbr\u003e 100 0 300\u003cbr\u003e 200 300 0\u003c/p\u003e \n \u003cp\u003e\u003cbr\u003e \u003cb"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003c/b\u003e\u003c/p\u003e \n \u003cp\u003e370\u003cbr\u003e \u003c/p\u003e \n \u003cp\u003e\u003cbr\u003e \u003c/p\u003e \n "}}]}