二分查找模板2
题目相关链接传送门: 1.https://blog.csdn.net/justidle/article/details/104593327?utm_medium=distribute.pc_relevant.none-task-blog-baidujs-5&spm=1001.2101.3001.4242 2.https://vjudge.net/contest/378940#problem/C 我的AC代码: #include<bits/stdc++.h> using namespace std; int lower_bound( int a[], int left, int right, int x) // 检索数组中大于等于给定数x的最小项,返回其下标 { while (left<= right) { int mid=(left+right)/ 2 ; if (a[mid]>=x) right=mid- 1 ; else left=mid+ 1 ; } // 最后,left和right是重合着的 return left; } int main() { int n,m,i; cin >>n>> m; int a[n]; for (i= 0 ;i<n;i++) cin>> a[i]; sort(a,a + n); for (i= 0 ;i<m;i++ ) { int x; cin