道路重建

题目大意：

一个无向图，n个点m条边（路），有d条边（路）烂掉了，你的任务是修复一些道路使A与B之间的连接恢复，并要求修复的道路长度最小。

解题思路：

n<=100
floyd可以过
至于怎么做：
我们要求修的道路最短要修多长
所以好的就不用管了，边权设为0就好
还有这道题是双向边注意一下

Accepted code：

#include<queue>
#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;

const int inf = 1000000000;
int n, m, a[101][101], z[101][101], x, y;

inline int read() {
    int f = 0; int flag = 1; char c = getchar();
    while (!isdigit(c)) {if (c == '-') flag=-1; c = getchar();}
    while (isdigit(c)) {f = (f << 3) + (f << 1) + c - 48; c = getchar();}
    return f * flag;
}
int main() {
	n = read(); m = read();
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			a[i][j] = inf;
	for (int i = 1; i <= m; i++)
		x = read(), y = read(), 
		z[x][y] = z[y][x] = read(), 
		a[x][y] = a[y][x] = 0;//假设都是好的路
	int d = read();
	for (int i = 1; i <= d; i++) {
		x = read(); y = read();
		a[x][y] = a[y][x] = z[x][y];
	}
	for (int k = 1; k <= n; k++)//Floyd
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (i != j && i != k && j != k)
					a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
	printf("%d",a[read()][read()]);
}