#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define codefor int test;cin>>test;while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; template istream& operator>>(istream& is, vector& vec) {for(T& x : vec)is >> x;return is;} template ostream& operator<<(ostream& os, const vector& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;} void in(){} template void in(Head& head, Tail&... tail){cin >> head;in(tail...);} void out(){cout << '\n';} templatevoid out(const T& a){cout << a << '\n';} template void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);} const int INF = 1 << 30; const long long INF2 = 1ll << 60; template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(b> n; vector2d(int, A, n, 3); for(int i = 0; i < n; i++) cin >> A[i][0]; rpriority_queue> pq; int mx = 0, ans = 1 << 30, v, i, j; for(int i = 0; i < n; i++){ cin >> A[i][1]; A[i][2] = (A[i][0] + A[i][1]) / 2; sort(A[i].begin(), A[i].end()); pq.emplace(A[i][0], i, 0); mx = max(mx, A[i][0]); } ans = min(ans, mx - get<0>(pq.top())); while(true){ tie(v, i, j) = pq.top(); if(j == 2)break; pq.pop(); v = A[i][++j]; mx = max(mx, v); pq.emplace(v, i, j); ans = min(ans, mx - get<0>(pq.top())); } cout << ans << '\n'; }