题解 | #最高身高#
最高身高
https://www.nowcoder.com/practice/258fe0c567ac493f9b7bc9d3669d158d
#include <iostream>
using namespace std;
int main() {
int m, n, k, l;
cin >> n >> m;
long int max = 0;
long lis[12][12];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> lis[i][j];
if (lis[i][j] > max) {
max = lis[i][j];
k = i + 1;
l = j + 1;
}
}
}
cout << k << " " << l << endl;
}
// 64 位输出请用 printf("%lld")
