编辑代码

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main() {
	int bb =1;
    // std::cout<<"bb is "<<std::endl;


    std::vector<vector<int>> aa={{1,3,5,7},{10,11,16,20},{23,30,34,60}};
    if(aa.size()==0) return 0;
    int m = aa.size();
    int n =aa[0].size();
    // if(lower_bound(&aa[0][0],&aa[0][0]+m*n,3))
        // if(binary_search(&aa[0][0]+m*n,&aa[0][0],3))
    auto cc = lower_bound(&aa[0][0],&aa[0][0]+m*n,60)-&aa[0][0];
    // auto dd = upper_bound(&aa[0][0],&aa[0][0]+m*n,23);
    bb =2;
    // std::cout<<"bb is "<<bb<<std::endl;
    // for(int i=0;i<4;i++){
    // //    std::cout<<"bb is "<<bb<<std::endl;
           
    //         if(binary_search(&aa[0],&aa[0]+aa.size(),3)) 
    //         bb =2;
            
    //    }
   std::cout<<"bb is "<<bb<<std::endl;
   std::cout<<"cc is "<<cc<<std::endl;
    std::cout<<"dd is "<<cc<<std::endl;
    if (bb==1) return 1;
	 else return 0;
}