бинарный поиск по матрице

#include <iostream>
#include <cmath>

using namespace std;

int bin_poisk (int **result, int left, int right, int key, int index_str)
{
  int i = 0;
  while (left < right)
  {
    i = (left + right) / 2;
    if (result[index_str][i] < key)
     left = i+1;
    else right = i;
}

if (result[index_str][right] == key)

return right;
return -1;
}

int* bin_poisk_1 (int **arr, int left, int right, int key, int razmer)
{
  int i = 0;
  int index_stolb = -1;

  while (right > left && index_stolb == -1)
  {
    i = (left + right) / 2;
    if (arr[i][razmer] < key )
     {
       left = i+1;
       index_stolb = bin_poisk(arr, 0, razmer, key, i+1);
     }
    else
    {
      right = i;
      index_stolb = bin_poisk(arr, 0, razmer, key, i);
    }
}

int *result = new int[2];

result[0] = i;
result[1] = index_stolb;

return result;
}

int main()
{
  int n, m, znach, shet = 0;
  cin >> n >> m;
  cin >> znach;

  int **arr = new int*[n];

   for (int i = 0; i < n; i++)
      arr[i] = new int[m];

   for (int i = 0; i < n; i++)
     for (int j = 0; j < m; j++)
         cin >> arr[i][j];

  int *index = new int[2];

  index = bin_poisk_1(arr, 0, m-1, znach, m-1);

cout << index[0]+1  << " " << index[1]+1;
}