题解 | 调整方阵

#include<iostream>
#include<vector>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<vector<int>> v(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%d", &v[i][j]);
		}
	}
	for (int i = 0; i < n; i++) {
		int index = i;
		int mmax = v[i][i];
		for (int j = i; j < n; j++) {
			if (v[j][i] > mmax) {	
				mmax = v[j][i];
				index = j;
			}
		}
		if (index != i) {
			for (int k = 0; k < n; k++) {
				int temp = v[i][k];
				v[i][k] = v[index][k];
				v[index][k] = temp;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			printf("%d ", v[i][j]);
		}
		printf("\n");
	}

}