lr9

#include <iostream>
#include <conio.h>
#include <time.h>
#include <chrono>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <string>

using namespace std;

int cheng = 0, simile = 0;
void sortByInserts(int arr[], int N) {
    int buff = 0;
    int i, j;

    for (i = 1; i < N; i++)
    {
        buff = arr[i];
        for (j = i - 1; j >= 0 && arr[j] > buff; j--)
            arr[j + 1] = arr[j];

        arr[j + 1] = buff;
    }
}

int main() {
    setlocale(LC_CTYPE, "");
    int num;
    cout << "Кiлькiсть елементiв: ";
    cin >> num;
    int** mass = new int* [num];
    for (int i = 0; i < num; i++)
    {
        mass[i] = new int[num];
    }
    for (int i = 0; i < num; i++)
    {
        for (int j = 0; j < num; j++)
        {
            mass[i][j] = rand() % 10;
            cout << mass[i][j] << " ";
        }
        cout << endl;
    }
    int* arr = new int[num];
    int index = 0;
    int element = 0;
    cout << endl;
    for (int i = 0; i < num; ++i)
    {
        arr[index] = mass[i][num - i - 1];
        index++;
    }




    cout << "\nВiдсортований масив:" << endl;
    sortByInserts(arr, index);

    for (int i = 0; i < index; i++) {
        cout << arr[i] << "\t";
    }
    delete[] mass;
    delete[] arr;

    return 0;
}