京东笔试第二题

起重机

#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    while (cin >> n >> m) {
        vector<vector<int>> inputs(m, vector<int>(3));
        vector<vector<int>> weights(1 + n);
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < 3; j++) {
                cin >> inputs[i][j];
            }
            int row = inputs[i][0], col = inputs[i][1], weight = inputs[i][2];
            weights[row].push_back(weight);
            weights[col].push_back(weight);
        }
        int res = INT_MAX;
        for (int i = 1; i <= n; i++) {
            sort(weights[i].begin(), weights[i].end());
            int temp = weights[i].back();
            res = min(res, temp);
        }
        cout << res << endl;
    }
    return 0;
}