Submission #67934063

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

template <typename T, typename... Args>
void dbg(const T &first, Args... args) {
	cout << first;
	if constexpr (sizeof...(args)) {
		cout.put(' ');
		dbg(args...);
	} else {
		cout << endl;
	}
}

constexpr int N = 300000 + 1;

int a[N], b[N];

void solve() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; ++i) {
		cin >> b[i];
	}
	
	ll ans = accumulate(a + 1, a + n + 1, 0ll) + accumulate(b + 1, b + n + 1, 0ll);
	
	multiset<int> mst;
	for (int i = 1; i <= n; ++i) {
		mst.insert(a[i]);
	}
	for (int i = 1; i <= n; ++i) {
		auto itr = mst.lower_bound(m - b[i]);
		if (itr == mst.end()) {
			continue;
		}
		mst.erase(itr);
		ans -= m;
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
#ifdef jiji
	freopen("../IO/input.txt", "r", stdin);
#endif
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}

Submission Info

Judge Result