提交时间:2026-05-29 19:32:12
运行 ID: 41755
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) cin >> b[i]; sort(a.begin(), a.end()); sort(b.begin(), b.end()); int ans = 0; for (int k = 0; k < n; ++k) { int minn = LLONG_MAX; for (int i = 0; i < n; ++i) { int j = (i + k) % n; minn = min(minn, abs(a[i] - b[j])); } ans = max(ans, minn); } cout << ans << '\n'; } return 0; } /* 4 3 0 0 0 1000000000 1000000000 1000000000 5 1 2 3 4 5 1 2 3 4 5 6 0 0 0 100 100 100 100 100 100 0 0 0 7 14 25 62 74 86 95 12 51 62 71 72 92 20 84 */