#include <stdio.h>
#include <cstdlib>






int main()
{
	int n, m;
	printf("Enter numbers string, columns: ");
	scanf("%d %d", &n, &m);
	int** arr = new int*[n];
	for (int i = 0; i < n; i++)
	{
		arr[i] = new int[m];
	}
	printf("Enter matrix: \n");
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf("%d", &arr[i][j]);
		}
	}

	printf("Your matrix: \n");
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			printf("\t%d", arr[i][j]);
		}
		printf("\n");
	}


//Начало сортировки (методом пузырька)
	int k, i, j, jp, ip;
	int size = m * n;
	bool flag;
	do
	{
		flag = false;
		for (int k = 1; k < size; k++)
		{
			j = k / n;
			i = k - j * n;
			jp = (k - 1) / n;
			ip = (k - 1) - jp * n;
			if (ip == n-1)
			{
				continue;
			}
			if (arr[i][j] < arr[ip][jp])
			{
				double tmp = arr[i][j];
				arr[i][j] = arr[ip][jp];
				arr[ip][jp] = tmp;
				flag = true;
			}
		}
	} while (flag);

//Конец сортировки




	printf("Result Matrix: \n");
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			printf("\t%d", arr[i][j]);
		}
		printf("\n");
	}





    return 0;
}