80分求解

#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;

signed main() {
	cin >> n >> m;
	int a[n + 5], b[m + 5];
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i];
	}
	sort(a + 1, a + n + 1, greater<int>());
	sort(b + 1, b + n + 1, greater<int>());
	if (n == 1) {
		for (int i = 1; i <= m; i++) {
			a[1] += b[i];
		}
		cout << a[1];
		return 0;

	} else {
		for (int i = 1; i <= m; i++) {
			if (b[i] > 0) {
				a[1] += b[i];
			} else {
				cout << a[1];
				return 0;
			}
		}
		cout << a[1];
		return 0;
	}

}