int s = 0,e = n - 1;
while(s < e)
{
	int mid = (s + e + 1) >> 1;
	if(len[mid] <= num) s = mid;
	else e = mid - 1;
}
return s;