题解 | #强强联合#
强强联合
https://ac.nowcoder.com/acm/problem/22218
#include <bits/stdc++.h> using namespace std; int main() { int x , y; cin >> x >> y; int a[x],b[y];
for( int i = 0 ; i < x ; i ++ ) cin >> a[i];
for( int i = 0 ; i < y ; i ++ ) cin >> b[i];
int k = 0;
for( int j = 0 ; j < x ; j ++ )
{
if(a[k] < a[j]) a[k] = a[j];
}
for( int j = 0 ; j < y ; j ++ )
{
if(b[k] < b[j]) b[k] = b[j];
}
cout << a[k] + b[k] << endl;
return 0;
}
