c++ 之鞍点，求矩阵鞍点

#include <iostream>
#include <iostream>

using namespace std;

int main()
{
   int nr,nc;
   cin>>nr>>nc;
   int **p=new int *[nr];
   for(int r=0;r<nr;r++)
   {
       p[r]=new int [nc];
       for(int c=0;c<nc;c++){ cin>>p[r][c]; }
   }
  int k=p[0][0];
    int a=0;
    int b=0;
    for(int r=1; r<nr; r++)
    {
        if(k<p[r][0])
        {
            k=p[r][0];
            a=r;
        }
    }
    for(int c=1; c<nc; c++)
    {
        if(k>p[a][c])
        {