https://leetcode.com/problems/search-insert-position/
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int i;
int flag=0;
for ( i=0; i<nums.size(); i++)
{
if (target <= nums[i])
{
return i;
}
}
return i;
}
};