import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int m = in.nextInt();
int n = in.nextInt();
int[][] A = new int[m][n];
int[] rowMin = new int[m];
int[] colMax = new int[n];
for(int i=0; i<m; i++){
rowMin[i] = 201;
}
for(int i=0; i<n; i++){
colMax[i] = 0;
}
for(int i=0; i<m; i++){
for(int j=0; j<n; j++){
A[i][j] = in.nextInt();
if(A[i][j] < rowMin[i]){
rowMin[i] = A[i][j];
}
if(A[i][j] > colMax[j]){
colMax[j] = A[i][j];
}
}
}
boolean f = false;
for(int i=0; i<m; i++){
for(int j=0; j<n; j++){
// if(A[i][j] == rowMin[i] && A[i][j] == colMax[j])
if(rowMin[i] == colMax[j]){
System.out.println(A[i][j]);
f = true;
}
}
}
if(f == false) System.out.println("no");
}
}
U290933 矩阵中的幸运数(Lucky number in matrix)
最新推荐文章于 2024-08-12 16:47:32 发布