Submission #67925049

---

Source Code Expand

#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
namespace mlp = boost::multiprecision;
using bint = mlp::cpp_int;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using mint = modint998244353;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define rep1(i,n) for (int i=1;i<(int)(n);i++)
#define rrep(i,n) for (ll i=n-1;i>=0;i--)
#define rrep1(i,n) for (ll i=n-1;i>0;i--)
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define pi 3.141592653589793238L

//対オーバーフロー兵器
//#define int long long

signed main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int T; cin>>T;
  rep(w,T){
    ll N,M; cin>>N>>M;
    vector<ll> A(N),B(N);
    rep(i,N) cin>>A[i];
    rep(i,N) cin>>B[i];
    sort(A.begin(),A.end());

    ll ans=0;
    rep(i,N) {ans+=A[i]; ans+=B[i];}

    multiset<ll> st;
    rep(i,N) st.insert(B[i]);
    st.insert(1e+18);

    rep(i,N){
      auto itr=st.lower_bound(M-A[i]);
      if (*itr==1e+18) continue;
      st.erase(st.find(*itr));
      ans-=M;
    }
    cout<<ans<<endl;

  }


  

  return 0;
}

Submission Info

Judge Result