35. Search Insert Position

//https://leetcode.com/problems/search-insert-position/
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        return  distance(nums.begin() , lower_bound(nums.begin(),nums.end(),target));
    }
};