2021牛客暑期多校训练营1 G

题目大意：

  给定序列 A,B，需要交换恰好 k 次 A 中两个不同的数，使得 A,B 每个位置的绝对差值和最大。
  N <= 100000

解题思路：

AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 10;
int n, k;
int a[maxn], b[maxn], c[maxn << 1];
int flaga[maxn], flagb[maxn];
int cntd, d[maxn], cnte, e[maxn];
ll ans = 0;
int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i], c[i] = a[i];
    for (int i = 1; i <= n; i++) cin >> b[i], c[i + n] = b[i];
    if (n == 2) {
        if (k & 1) ans = abs(a[1] - b[2]) + abs(a[2] - b[1]);
        else ans = abs(a[1] - b[1]) + abs(a[2] - b[2]);
        cout << ans << endl;
        return 0;
    }
    sort (c + 1, c + 2 * n + 1);
    for (int i = 1, p; i <= n; i++) {
        p = lower_bound(c + 1, c + 2 * n + 1, a[i]) - c;
        if (p <= n) flaga[i] = -1;
        else flaga[i] = 1; 
    }
    for (int i = 1, p; i <= n; i++) {
        p = lower_bound(c + 1, c + 2 * n + 1, b[i]) - c;
        if (p <= n) flagb[i] = -1;
        else flagb[i] = 1; 
    }
    for (int i = 1; i <= n; i++) {
        if (flaga[i] == flagb[i] && flaga[i] == 1) 
            d[++cntd] = min(a[i], b[i]);
        else if (flaga[i] == flagb[i] && flaga[i] == -1)
            e[++cnte] = max(a[i], b[i]);
        ans += abs(a[i] - b[i]);
    }
    //分别从小到大排以及从大到小排，为了使差值最大化
    sort (e + 1, e + cnte + 1); 
    sort (d + 1, d + cntd + 1, greater<int>());
    // cout << cntd << " " << cnte << endl;
    for (int i = 1; i <= min(k, cntd); i++) {
        ans += 1ll * 2 * (d[i] - e[i]); 
    }
    cout << ans << endl;
}