刷时间的来着

#include <iostream>
#include <unordered_map>
#include <climits>
using namespace std;

int main() {
int n, m;
cin >> n >> m;

unordered_map<int, unordered_map<int, int>> adj;

for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;

    if (!adj[u].count(v) || w < adj[u][v]) {
        adj[u][v] = w;
        adj[v][u] = w;
    }
}

int k;
cin >> k;

int count = 0, total = 0;
for (auto& [neighbor, cost] : adj[k]) {
    count++;
    total += cost;
}

cout << count << " " << total << endl;
return 0;

}