for (int row = 0; row < n; row++) {
int localMax = arr[row][0];
int maxColumn=0;
for (int column = 0; column < m; column++) {
if (localMax < arr[row][column]) {
localMax = arr[row][column];
maxColumn=column;
}
}
//2 часть
int localMin = localMax;
bool isMinInColumn=true;
for(int row2=0;row2<n;row2++){
if(arr[row2][maxColumn]<=localMin && row2!=row){
isMinInColumn=false;
break;
}
}
if(isMinInColumn){
//печатаем ответ тут
//System.out.println("Ответ:"+localMin);
break;
}
}
if (choise == 1) {
res = Function1(a, b);
}
else if (choise == 2) {
res = Function2(a, b);
}
else if (choise == 3) {
res = Function3(a, b);
}
else if (choise == 4) {
res = Function4(a, b);
}
class Product_release:Balances,Product