//
//  main.cpp
//  exam
//
//  Created by Rom Dr on 23.06.2018.
//  Copyright © 2018 Rom Dr. All rights reserved.
//

#include <iostream>

const int N = 3;
const int M = 3;



int main(int argc, const char * argv[]) {

    int matr[N][M] = {
        {10, 4, 5,},
        {1, 1, 0},
        {2, 5, 9}
    };

    int growing_line = -1; // номер строки которая возрастает

    for (int i = 0; i < N; ++i) {
        bool is_growing = true;
        for (int j = 0; j < (M-1) && is_growing; ++j){
            is_growing = matr[i][j] < matr[i][j+1];
        }
        if (is_growing) {
            growing_line = i;
            break;
        }
    }

    if (growing_line >= 0) {
        std::cout << "Growing line num: " << growing_line + 1 << "\n";
    } else {
        std::cout << "Growing Line not found\n";
        return 0;
    }

    int tmp[M];
    for (int j = 0; j < M; j++) {
        tmp[j] = matr[0][j];
        matr[0][j] = matr[growing_line][j];
    }

    int swapped_line[M];
    for (int i = 1; i < N; i++) {
        for (int j = 0; j < M; ++j) {
            swapped_line[j] = matr[i][j];
            matr[i][j] = tmp[j];
            tmp[j] = swapped_line[j];
        }
    }

    for (int i = 0; i < N; i ++ ){
        for (int j = 0; j < M; j++) {
            std::cout << matr[i][j] << "\t";
        }
        std::cout << std::endl;
    }


    return 0;
}