pat 乙级 1107 老鼠爱大米

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

int main(){
    int N, M, data;
    cin >> N >> M;
    int max[N] = {0};
    for(int i = 0; i < N; i++){
        for(int j = 0; j < M; j++){
            cin >> data;
            if(data > max[i]) max[i] = data;
        }
        if(i != 0) cout << " ";
        cout << max[i];
    }
    cout << endl;
    sort(max, max + N);
    cout << max[N-1];
    return 0;
}