#include #include using namespace std; using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; using ll = long long; ll INF = 2e18; template using vc = vector; template using vv = vc>; using vi = vc; using vvi = vv; using vl = vc; using vvl = vv; using vs = vc; using vvs = vv; using vb = vc; using vvb = vv; using vmint = vc; using vvmint = vv; #define rep(i,n) for(ll i=0; i<(n); i++) #define drep(i,n) for(ll i=(n)-1; i>=0; i--) #define rrep(i,n) for(ll i=1; i<=(n); i++) #define nfor(i,a,b) for(ll i=a;i=(b); i--) templateistream& operator>>(istream& i, vc& v) {rep(j,(ll) size(v))i >> v[j]; return i; } #define nall(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define chmax(x,y) x = max(x,y) #define chmin(x,y) x = min(x,y) #define YES cout<<"Yes"<> N; vl A(N), B(N-1); rep(i,N) cin >> A[i]; rep(i,N-1) cin >> B[i]; sort(nall(A)); sort(nall(B)); vl upsum(N); vl downsum(N); rep(i,N-1) { upsum[i+1] = upsum[i] + abs(A[i] - B[i]); } drep(i,N-1) { downsum[i] = downsum[i+1] + abs(A[i+1] - B[i]); } ll bad = INF; set ans; rep(i,N) { if (bad == upsum[i] + downsum[i]) { ans.insert(A[i]); } else if (bad > upsum[i] + downsum[i]) { ans.clear(); ans.insert(A[i]); } chmin(bad,upsum[i]+downsum[i]); } int ans_size = ans.size(); cout << ans_size << endl; for (auto a : ans) cout << a << " "; cout << endl; }