提出 #67981263

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void test() {
    int N; ll M;
    cin >> N >> M;
    
    ll A[N+1], B[N+1];
    for (int i = 1; i <= N; i++) cin >> A[i];
    for (int i = 1; i <= N; i++) cin >> B[i];
    
    sort(A+1, A+N+1);
    sort(B+1, B+N+1);
    ll sum_AB = accumulate(A+1, A+N+1, 0LL) + accumulate(B+1, B+N+1, 0LL);
    
    int l = 0, r = N+1;
    while (r-l > 1) {
        int mid = (l+r)>>1;
        bool pass = true;
        for (int i = 0; i < mid; i++)
            pass &= (A[N-i]+B[N-mid+i+1] >= M);
        if (pass) l = mid;
        else r = mid;
    }
    
    cout << sum_AB - M*l << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int T;
    cin >> T;
    while (T--) test();
}

提出情報

ジャッジ結果