void findMayores(int x[][MAX],int fil, int col, int vector[MAX], int n){

int i,j,may=0,aux,ix,jx,k=0;
while(k<n-1){
for(i=0;i<fil;i++){
for(j=0;j<col;j++){
if(x[i][j]>may && x[i][j]!=vector[j]){
may=x[i][j];
ix = i;
jx = j;
}
}
}
//printf("%d ",may);
printf("\n");
vector[k]=may;
aux = x[ix][jx];
x[ix][jx]=x[k][k];
x[k][k] = aux;
may=0;
k++;
}
}