ArreglosEspeciales.cc

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(cont) cont.begin(), cont.end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define fore(i, a, b) for (int i = a, almo5t = b; i < almo5t; ++i)
#define SZ(x) ((int)x.size())
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define FIN                                \
    std::ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                         \
    cout.tie(NULL)

typedef long long int ll;

using namespace std;

int main()
{
    FIN;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int n;
    cin >> n;
    int a[n];
    set<int> aS;
    fore(i, 0, n)
    {
        cin >> a[i];
        aS.insert(a[i]);
    }
    int m;
    cin >> m;
    int b[m];
    set<int> bS;
    fore(i, 0, m)
    {
        cin >> b[i];
        bS.insert(b[i]);
    }
    int ansA, ansB;
    fore(i,0,n) fore(j,0,m){
        if(aS.find(a[i]+b[j]) == aS.end() && bS.find(a[i]+b[j]) == bS.end()){
            ansA=a[i];ansB=b[j];
        }
    }

    cout<<ansA<<" "<<ansB;
    return 0;
}