Codeforces Round #251 (Div. 2) - Devu and his Brother

标准解法 三分。因为是整型的三分不能用 L < R 作为循环条件，循环 100 次就行了

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
int a[100010], b[100010];
int n, m;
bool cmp(int a, int b) {
    return a > b;
}
ll check(int M) {
    ll ret = 0;
    for (int i = 0; i < n; ++ i) {
        if (a[i] < M) {
            ret += (M - a[i]);
        }
    }
    for (int i = 0; i < m; ++ i) {
        if (b[i] > M) {
            ret += (b[i] - M);
        }
    }
    return ret;
}
int main() {
    while (cin >> n >> m) {
        for (int i = 0; i < n; ++ i) {
            cin >> a[i];
        }
        for (int i = 0; i < m; ++ i) {
            cin >> b[i];
        }
        sort(a, a + n);
        sort(b, b + m, cmp);
        int L = a[0], R = b[0];
        if (L >= R) {
            cout << 0 << endl;
            continue;
        }
        ll cnt = 0;
        for (int i = 0; i < m; ++ i) {
            if (b[i] > L) {
                cnt += (b[i] - L);
            }
        }
        ll res1, res2;
        for (int i = 0; i <= 100; ++ i) {
            int m1 = L + (R - L) / 3;
            int m2 = R - (R - L) / 3;
            //cout << L << " " << m1 << " " << m2 << " " << R << endl;
            //cout << cnt << endl;
            res1 = check(m1);
            res2 = check(m2);
            if (res1 < cnt) {
                cnt = res1;
            }
            if (res2 < cnt) {
                cnt = res2;
            }
            if (res1 >= res2) {
                L = m1;
            }
            else {
                R = m2;
            }
        }
        cout << cnt << endl;
    }
}