//二分查找
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int search(vector<int>& nums, int target) {
int low = 0, high = nums.size()-1, mid;
while(low<=high)
{
mid = (low+high)/2;
if(nums[mid]>target)
high = mid-1;
else if (nums[mid]<target)
low = mid+1;
else
return mid;
}
return -1;
}
int main()
{
}