先分別對學校的分數線和學生的估分進行排序(由小到大),對每位學生,都將所有的學校分數線二分枚舉一遍,如果學校的分數線比學生的估分高,則向左邊枚舉,反之向右邊枚舉,總體趨勢是向差距最小的學校靠攏。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int M, N;
cin >> M >> N;
int school[M + 1], student[N + 1];
for (int i = 0; i < M; i++) {
cin >> school[i];
}
for (int j = 0; j < N; j++) {
cin >> student[j];
}
sort(school, school + M);
sort(student, student + N);
ll tot = 0;
for (int i = 0; i < N; i++) {
int L = 0, R = M - 1, min_diff = 1e9;
while (L <= R) {
int Mid = L + (R - L) / 2;//
int diff = school[Mid] - student[i];//記錄差值
min_diff = min(min_diff, abs(diff));//記錄最小絕對值
if (diff < 0) {//如果學校分數線低於學生的估分,向右邊查找
L = Mid + 1;
}
else if (diff > 0) {//如果學校的分數線高於學生的估分,向左邊查找
R = Mid - 1;
}
else {
break;
}
}
tot += min_diff;
}
cout << tot << endl;
return 0;
}