Searching in 2D Array(selfmade with same time complexity).txt

#include<iostream>
#include<climits>

using namespace std;


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

 bool f=false;
 for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
       if(a[i][m-1]<target){
          break;
       }
       else if(a[i][j]==target){
          f=true;
       }
    }
 }
 if(f){
    cout<<"Element is found";
 }
 else{
    cout<<"Element is not found";
 }

   return 0;
}