将矩阵中和值最大的一行元素与首行调换

#include<iostream>
using namespace std;
int main() {
	int a[3][4], b[3][4] = { 0 },sum = 0, max = 0, k = 0;
cin >> a[0][0] >> a[0][1] >> a[0][2] >> a[0][3] >> a[1][0] >> a[1][1] >> a[1][2] >> a[1][3] >> a[2][0] >> a[2][1] >> a[2][2] >> a[2][3];//输入矩阵 
		for (int j = 0; j <= 3; j++) {
			max += a[0][j];//求第一行的和
		}
	for (int i = 1; i <= 2; i++) {
		sum = 0;
		for (int j = 0; j <= 3; j++) {
			sum += a[i][j];
		}
			if (max < sum) {
				max = sum;
				k = i;//找出和值最大的一行
			}

	}
	if (k > 0) {
	        for (int j = 0; j <= 3; j++) {
				b[0][j] = a[0][j];
				a[0][j] = a[k][j];
				a[k][j] = b[0][j];//调换
			}
	}
	for (int i = 0; i <=2; i++) {
		cout << endl;
		for (int j = 0; j <= 3; j++) {
			cout << a[i][j]<<'\t';
		}
	}
   return 0;
}