#include <bits/stdc++.h>
using namespace std;
long long int v[100005], rem[100005];
void solve() {
  long long int n, sum = 0;
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &rem[i]);
    sum += rem[i];
  }
  for (int i = 0; i < n; i++) {
    long long int a;
    scanf("%lld", &v[i]);
  }
  sort(v, v + n);
  if ((v[n - 1] + v[n - 2]) >= sum)
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  int tst = 1;
  while (tst--) solve();
  return 0;
}
