#include <iostream>
using namespace std;

void swap (double *a, double *b);
void diag (double **ar, int size);
int searchneg (double **ar, int size);

int main()
{
    int size;
    cout << "Input size of matrix\n>> ";
    cin >> size;
    double **matrix;
    matrix = new double* [size];
    for (int i = 0; i < size; i++)
        matrix[i] = new double[size];
    cout << "Input matrix:\n";
    for (int i = 0; i < size; i++)
        for (int j = 0; i < size; i++)
            cin >> matrix[i][j];
    if (searchneg(matrix, size) == -1)
        cout << "There are no negarive rows in matrix\n";
    else
        cout << searchneg(matrix, size) << " line is negative\n";
    diag(matrix, size);
    cout << "Matrix after transformation: ";
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; i < size; i++)
            cout << matrix[i][j] << " ";
        cout << endl;
    }
    for (int i = 0; i < size; i++)
        delete [] matrix[i];
    delete [] matrix;
    return 0;
}

void swap (double *a, double *b)
{
    double temp = *a;
    *a = *b;
    *b = temp;
}

void diag (double **ar, int size)
{
    for (int i = 0; i < size; i++)
    {
        double max = ar[i][i];
        int m, n;
        for (int j = 0; i < size; i++)
            for (int k = 0; i < size; i++)
                if (ar[j][k] > max)
                {
                    max = ar[j][k];
                    m = j;
                    n = k;
                }
        swap (ar[i][i], ar[m][n]);
    }
    return;
}

int searchneg (double **ar, int size)
{
    int str = -1;
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; i < size; i++)
        {
            if (ar[i][j] > 0)
                break;
            else
                if (j == size - 1)
                    return str = i;
        }
    }
    return str;
}