infoarena

5412
5121
1245
7532

1245
5121
5412
7532

vector< int > a;
//....
sort( a.begin(), a.end() ); //le sorteaza crescator

int N, a[Nmax];
//....
sort( a, a+N );

mat[1][1]=5;mat[1][2]=3;
mat[2][1]=3;mat[2][2]=4;

mat[1][1]=3;mat[1][2]=4;
mat[2][1]=5;mat[2][2]=3;

vector < int > a[Max];

sort( a[i].begin() ; a[i].end() ) ; //sortezi coloana i

#include <algorithm>

using namespace std;

...

int cmp(int x, int y) {
   for (int i = 1; i <= N; ++i)
      if (A[i][x] != A[i][y]) return A[i][x] < A[i][y];

   return 0;
}
...
int main() {
...
for (int i = 1; i <= M; ++i) ind[i] = i;

sort(ind+1, ind+M+1, cmp);

for (int i = 1; i <= N; ++i) {
  for (int j = 1; j <= M ;++j) cout << A[i][ind[j]] << " ";
  cout << endl;
}
...
return 0;
}

void SortColumn(int column, int rows)
{
int ok;
do
   {
   ok=0;
   for( int i=1; i<rows ; ++i )
      if( a[i][column] > a[i+1][column] ) swap( a[i][column], a[i+1][column] ) , ok=1 ;
   }
while( ok );
}

int A[100][100];

int cmp(const void *a, const void *b)
{
   return ((int*)a)[nr_coloanei] - ((int*)b)[nr_coloanei];
}
. . .
int main()
{
  qsort(a, nr_linii, sizeof(a[0]), cmp);
  return 0;
}