Unt13

#include <iostream>
using namespace std;

int max_element(int **&A,int N){
    int max = A[0][0]
    for(int i = 0; i<N; ++i){
        for(int j = 0; j<N; ++j){
            if(A[i][j]>max){
                max = A[i][j];
            }
        }
return max;
}

void perebor(int**&A,int N){
    for(int i = 0; i<N;++i){
        C[N] = A[i][i];
    }
    for(bool f = true;f;){
        f = false;
        for(int i =0; i<N; ++i ){
            if (A[i] > A[i+1]){
                int tmp = A[i];
                A[i] = A[i+1];
                A[i+1] A[i];
                f = true;
            }

        }

}

int main(){
    int N,M;
    cin>>N;
    int**A;
    A = new int*[N];
    for(int i = 0; i<N; ++i ){
        A[i] = new int*[N];
    }
    for(int i = 0; i<N; ++i){
        for(int j = 0; j<N; ++j){
            cin>>A[i][j];
        }
        cin>>M;
        int**B;
        B = new int*[M];
        for(int i =0;i<M;++i){
            B[i] = new int*[M];
        }
        for(int i =0; i<M;++i)
        {
            for(int j = 0; j<M;++j){
                cin>>B[i][j];
            }
        }
    maxA = max_element(A,N);
    maxB = max_element(B,N);
        if(maxA>maxB){
            perebor(A,N);}

            else
        {
            perebor(B,M);
        }

    }
}