sortv

#include <fstream>
#include <iomanip>
#include <iostream>

using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");
void sortubiv(int** a, int n,int k)
{
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = i + 1; j < n; j++)
            if (a[j][k] > a[i][k])
                swap(a[i][k], a[j][k]);
    }
}

void sortvozr(int** a, int n, int k)
{
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = i + 1; j < n; j++)
            if (a[j][k] < a[i][k])
                swap(a[i][k], a[j][k]);
    }
}


int main()
{
    int n, i, j;
    in >> n;
    int** mas = new int* [n];
    for (int i = 0; i < n; ++i)
        mas[i] = new int[n];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            in >> mas[i][j];

    for (int i = 0; i < n; ++i, out << "\n")
        for (int j = 0; j < n; ++j)
            out << " " << mas[i][j];
    out << "\n";

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            if (j % 2 == 0)
                sortvozr(mas, n, j);
            else
                sortubiv(mas, n, j);

    for (int i = 0; i < n; ++i, out << "\n")
        for (int j = 0; j < n; ++j)
            out << " " << mas[i][j];
    in.close();
    out.close();
    return 0;