d
  • 板块灌水区
  • 楼主Mike_Evans
  • 当前回复1
  • 已保存回复1
  • 发布时间2024/8/28 15:22
  • 上次更新2024/8/28 15:22:25
查看原帖
d
1364340
Mike_Evans楼主2024/8/28 15:22
#include<bits/stdc++.h>
using namespace std;
int main() {
	int n, m, a[114514], l, r, mid, x;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 1; i <= m; i++) {
		l = 1;
		r = n;
		cin >> x;
		while (l <= r) {
			mid = (l + r) / 2;
			if (a[mid] >= x)
				r = mid - l;
			else
				l = mid + 1;
			
		}
		cout << a[r] <<endl;
	}
	return 0;
}
2024/8/28 15:22
加载中...