1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <algorithm>
#include <vector>
#include <iostream>
#include <cmath>
#include <climits>
using namespace std;
int main(){
    int N, M, L;
    cin>>N>>M>>L;
    vector<long long> A(N), B(M), C(L);
    int i = 0;
    while(N-- > 0)
        cin>>A[i++];
    i = 0;
    while(M-- > 0)
        cin>>B[i++];
    i = 0;
    while(L-- > 0)
        cin>>C[i++];
    A.push_back(INT_MAX);
    A.push_back(INT_MIN);
    B.push_back(INT_MAX);
    B.push_back(INT_MIN);
    C.push_back(INT_MAX);
    C.push_back(INT_MIN);
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    sort(C.begin(), C.end());
    long long ans = INT_MAX;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX