鞍点问题~帮忙差错~在线等~

#include <iostream>
using namespace std;

int main()
{
const size_t x = 4, y = 5;
int array[x][y], min_x, max_y;
size_t min_i = 0, max_j = 0;
bool judge = true;

cout << "输入一个二维数组("
<< x << "行" << y << "列):"
<< endl;

for (size_t ci = 0; ci != x; ++ci)
{
cout << "输入第" << ci + 1 << "行("
<< y << "个整数):" << flush;
for (size_t cj = 0; cj != y; ++cj)
{
cin >> array[ci][cj];
}
}

for (size_t i = 0; i != x; ++i)
{
size_t j = 0;
max_y = array[i][j];
for (/**/; j != y; ++j)
if (max_y < array[i][j])
{
max_y = array[i][j];
max_j = j;
}

size_t fi = 0;
min_x = array[fi][max_j];
for (/**/; fi != x; ++fi)
if (min_x > array[fi][max_j])
{
min_x = array[fi][max_j];
min_i = fi;
}

if (i == min_i)
{
cout << "第" << min_i + 1 << "行"
<< max_j + 1 << "列的整数："
<< array[min_i][max_j]
<< "是该数组的一个鞍点。"
<< endl;
judge = false;
}
}

if (judge)
{
cout << "该数组没有鞍点。" << endl;
}

return 0;
}

偶新手~自己想了一个解决寻找二维数组鞍点（即行最大列最小）的所谓程序~用下面一组数据测试就是有问题~
1 12 3 4 5
2 4 16 8 10
3 6 8 12 15
4 8 12 16 20
来个热心人解决下~不需要高手~不希望把我的程序改得面目全非~