farhan.cpp

int BSL(int a[],int n,int x){       //binary_search_for_finding_leftmost
    sort(a, a+n);
    int l=0,r=n,m;
    while(l<r){
        m=(l+r)/2;
        if(x<=a[m]) r=m;
        else        l=m+1;
    }
    return l;
}
int BSR(int a[],int n,int x){       //binary_search_for_finding_rightmost
    sort(a, a+n);
    int l=0,r=n,m;
    while(l<r){
        m=(l+r)/2;
        if(x>=a[m]) l=m+1;
        else        r=m;
    }
    return l-1;
}