题解 | 最高身高
最高身高
https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
#include <iostream>
using namespace std;
int main() {
int n, m, t = 0, o = 0, p = 0;
cin >> n >> m;
int a[n][m];
for(int i = 0; i < n; i ++){
for(int j = 0; j < m; j ++){
cin >> a[i][j];
if(t < a[i][j]){
t = a[i][j];
o = i;
p = j;
}
}
}
cout << o + 1 << " " << p + 1;
}