烦恼的高考志愿——洛谷1678

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 100010;

int n, m;
int a[N], w[N];

int main()
{
    scanf("%d%d", &m, &n);
    for (int i = 0; i < m; i ++ ) cin >> a[i];
    for (int i = 0; i < n; i ++ ) cin >> w[i];
    
    sort(a, a + m);
    sort(w, w + n);
    
    LL res = 0;
    for (int i = 0; i < n; i ++ )
    {
        int l = 0, r = m;
        while (l < r)
        {
            int mid = l + r >> 1;
            if (a[mid] >= w[i]) r = mid;
            else l = mid + 1;
        }
        
        if (r == 0) 
            res += abs(a[r] - w[i]);
        else 
            res += min(abs(a[r] - w[i]), abs(a[r - 1] - w[i]));
    }
        printf("%lld\n", res);
        return 0;
}