未优化版
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxsize = 505;
const int inf = 0x3f;
int graph[maxsize][maxsize];
int dist[maxsize];
bool st[maxsize];
int n, m;
int dijkstra(int u)
{
memset(dist, 0x3f, sizeof dist);
dist[u] = 0;
for (int i = 0; i < n; i++)
{
int temp = -1;
for (int j = 1; j <= n; j++)
if (st[j] == false && (temp == -1 || dist[j] < dist[temp]))
{
temp = j;
}
if (temp == n) break;
st[temp] = true;
for (int j = 1; j <= n; j++)
dist[j] = min(dist[j], graph[temp][j] + dist[temp]);
}
if (dist[n] == 0x3f3f3f3f) return -1;
return dist[n];
}
int main()
{
int a, b, c;
scanf("%d %d", &n, &m);
memset(graph, 0x3f, sizeof graph);
for (int i = 0; i < m; i++)
{
scanf("%d %d %d", &a, &b, &c);
graph[a][b] = min(graph[a][b], c);
}
cout << dijkstra(1) << endl;
return 0;
}