rt, 求入门赛 H 题思路，调了挺久没调出来，目前代码如下：

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, a[10005], b[10005], c[10005], tot = 0, cnt = 0, sum = 0;
int main() {
    cin >> n;
    for (ll i = 1; i <= n; i++) cin >> a[i];
    for (ll i = 1; i <= n; i++) cin >> b[i];
    for (ll i = 1; i <= n; i++) {
        if (a[i] > b[i]) {
            cnt ++;
        } else {
            tot ++; c[tot] = b[i] - a[i];
        }
    }
    sort(c + 1, c + tot + 1);
    ll now = tot;
    for (ll i = 1; i <= tot; i++) {
        sum += c[i] + 1; cnt ++, now--;
        if (cnt > now) {
            break;
        }
    }
    cout << sum << endl;
}

求条 qwq