题目1470：调整方阵

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <climits>
using namespace std;
 
 
//1470
int mtr[11][11];
void help(int i,int n){
    int j=i+1,max_i=i;
    for(;j<=n;j++){
        if(mtr[j][i]>mtr[max_i][i])
            max_i=j;
    }
    if(i!=max_i){ //要交换行
        for(j=1;j<=n;j++)
            swap(mtr[i][j],mtr[max_i][j]);
    }
}
int main(){
    int n;
   // freopen("input.txt","r",stdin);
    while(cin>>n){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                cin>>mtr[i][j];
        for(int i=1;i<=n-1;i++)
            help(i,n);
        for(int i=1;i<=n;i++){
            cout<<mtr[i][1];
            for(int j=2;j<=n;j++)
                cout<<" "<<mtr[i][j];
            cout<<endl;
        }
    }
    return 0;
}
/**************************************************************
    Problem: 1470
    User: cust123
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:1520 kb
****************************************************************/