A. Choose Two Numbers

题意：从A数组和Ｂ数组中各找到一个数字，使得它们的和不会在两个数组中出现。
思路：从A、B数组各取一个最大值即可。
AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int a[maxn];
int b[maxn];
int main(void){
    int n,m;
    cin>>n;
    int maxx1 = -1;
    int maxx2 = -1;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        maxx1 = max(maxx1,a[i]);
    }
    cin>>m;
    for(int i = 1; i <= m; i++){
        cin>>b[i];
        maxx2 = max(maxx2,b[i]);
    }
    cout<<maxx1<<" "<<maxx2<<endl; 
    return 0;
}