Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n, m, x, y, l;
- cin >> n >> m;
- long long d[n][n];
- for(int i = 0; i < n; i++)
- for(int j = 0; j < n; j++){
- if(i == j)
- d[i][j] = 0;
- else
- d[i][j] = 1000000000000;
- }
- for(int i = 0; i < m; i++){
- cin >> x >> y >> l;
- d[x-1][y-1] = l;
- }
- for (int k = 0; k < n; k++)
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++)
- d[i][j] = min (d[i][j], d[i][k] + d[k][j]);
- long long ans = 0, sum = 1000000000000;
- for(int i = 0; i < n; i++){
- long long temp = 0;
- for(int j = 0; j < n; j++)
- temp += d[i][j];
- if(temp < sum){
- sum = temp;
- ans = i;
- }
- }
- cout << ans + 1 << " " << sum;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement