题解 | 矩阵最大值

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

/*
 *矩阵最大值
 * */
int main(){
	int m,n;
	while(cin>>m>>n){
		int ans[m][n];
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				cin>>ans[i][j];
			}
		}
		for(int i = 0;i<m;i++){
			int sum = 0;
			int p = 0;
			int maxValue = INT_MIN;	
			for(int j = 0;j<n;j++){
				sum+=ans[i][j];
				if(maxValue<ans[i][j]){
					maxValue = ans[i][j];
					p = j;
				}
			}
			ans[i][p] = sum;
		}
		for(int i =0;i<m;i++){
			for(int j =0;j<n;j++){
				cout<<ans[i][j]<<" ";
			}
			cout<<endl;
		}
	}
}