1107 老鼠爱大米

solution

记录每组的最大值，并比较组间的最大值胖胖鼠~

#include<iostream>
using namespace std;
int main(){
	int n, m, ans, fat = -1, x;
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; i++){
		ans = -1;
		for(int j = 0; j < m; j++){
			scanf("%d", &x);
			if(x > ans) ans = x;
		}
		if(ans > fat) fat = ans;
		if(i) printf(" ");
		printf("%d", ans);
	}
	printf("\n%d", fat);
	return 0;
}