标题

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
int N;
cin >> N;
vector<vector<int>>mc(N, vector<int>(N, 0));

for(int i = 0; i < N-1; i++) {
    for(int j = i+1; j < N; j++) {
        cin >> mc[i][j];
        mc[j][i] = mc[i][j];
    }
}

vector<int> max_values;
for(int i = 0; i < N; i++) {
    int first = 0, second = 0;
    for(int j = 0; j < N; j++) {
        if(i == j) continue;
        if(mc[i][j] > first) {
            second = first;
            first = mc[i][j];
        } else if(mc[i][j] > second) {
            second = mc[i][j];
        }
    }
    max_values.push_back(second);
}

cout << "1\n" << *max_element(max_values.begin(), max_values.end());
return 0;

}