interface 
 type 
Treal=real;
Tint=integer;
Tarray= array  [ 0 .. 0 ]  of  TInt;
PArray=^TArray;
Tmatr= array  [ 0 .. 0 ]  of  PArray;
Pmatr=^Tmatr;
TUnSignedInt=word;
TError=TUnSignedInt;
TIndex=TunSignedInt;
Tkey=TUnSignedInt;
CMatrix= object 

 private 
matr:Pmatr;
 (***) 
 procedure  CMatrix.sort;
 type 
Tarr= array  [ 1 .. 1 ]  of  Tint;
Parr=^Tarr;
 var 
i,j,p,k,c,b:TUnSignedInt;
buf,x:TInt;
A:PArr;
need:longint;
flag:boolean;
 begin 
     need:=longint(n*sizeof(PArr));
      if  need>MaxAvail  then 
     flag:=false
      else 
      begin 
           getmem(A,need);
            for  j:= 1   to  n  do 
            begin 
                 for  i:= 1   to  m  do 
                 begin 
                       if  matr^[i]^[j]> 0   then 
                      A^[j]:=A^[j]+matr^[i]^[j];
                 end ;
           end ;
      end ;

(сама сортировка)

      for  c:= 1   to  n- 1   do 
      begin 
          k:=c;
          x:=A^[c];
           for  b:=c+ 1   to  n  do 
           begin 
                if  A^>x  [b]then 
                begin 
               x:=A^;
               k:=b;
                [b]end ;
           end ;
     x:=A^[k];
     A^[k]:=A^[c];
     A^[c]:=x;
      for  k:= 1   to  m  do 
      begin 
          buf:=matr^[k]^;
          mAtr^[k]^[b]:=mAtr^[k]^[c];
          mAtr^[k]^[c]:=Buf;
      [b]end ;
      end ;
 end ;