简单，代码放这了！

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
int n;
cin >> n;
vector<vector<int>> matrix(n, vector<int>(n, 0));
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
cin >> matrix[i][j];
matrix[j][i] = matrix[i][j];
}
}

int max_second = 0;
for (int i = 0; i < n; ++i) {
    vector<int> values;
    for (int j = 0; j < n; ++j) {
        if (i != j) {
            values.push_back(matrix[i][j]);
        }
    }
    sort(values.begin(), values.end(), greater<int>());
    if (values.size() >= 2) {
        if (values[1] > max_second) {
            max_second = values[1];
        }
    }
}

cout << 1 << endl;
cout << max_second << endl;

return 0;

}