search-insert-position

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        int j=lower_bound(A,A+n,target)-A;
        if(j>=n)return n;
        if(A[j]==target)return j;
        else return j;
    }
};