蓝桥杯备考----》二分算法之烦恼的高考志愿

#include <iostream>
#include <algorithm>
const int N = 1e5 + 10, INF = 0x3f3f3f3f;
using namespace std;
int m, n;
int a[N];
int main()
{
	cin >> m >> n;
	for (int i = 1; i <= m; i++)
	{
		cin >> a[i];
	}
	sort(a + 1, a + 1 + m);
	a[0] = -INF;
	int ret=0;
	for (int i = 1; i <= n; i++)
	{
		int x; cin >> x;
		auto it = lower_bound(a + 1, a + 1 + m, x);
		auto tmp = it;
		tmp--;
		ret += min(abs(*it - x), abs(*tmp - x));
	}
	cout << ret;



	return 0;
}