2Darraysearch.cpp

#include<iostream>
using namespace std;

int main()
{
    int n,m;
    cin>>n>>m;
    int element;
    cin>>element;
    int a[n][m];
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin>>a[i][j];
        }
    }

    int r=0,c=m-1;
    bool found=false;
    while(r<n&&c>=0)
    {
        if(a[r][c]==element)
        {
            found=true;
        }
        if(a[r][c]>element)
        {
            c--;
        }
        else{
            r++;
        }
    }
    if(found)
    {
        cout<<"element found";

    }
    else{
        cout<<"not found";
    }

}