杨轩亦for(int i = 1;i <=n;i++){ int l=1,r=cnt,ans=-1; while(l<=r){ int mid=(l+r )/2; if(a[mid] >= b[i]){ r=mid-1; ans=mid; } else l=mid+1; }