#include <bits/stdc++.h>
using namespace std;
int _I() {
  int x;
  scanf("%d", &x);
  return x;
}
struct node {
  int l, h, r;
  node() {}
  node(int x, int y, int z) {
    l = x;
    h = y;
    r = z;
  }
};
void solve() {
  int n = _I();
  int ar[100001];
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    long long x = _I();
    sum += x;
  }
  for (int i = 0; i < n; i++) {
    ar[i] = _I();
  }
  sort(ar, ar + n);
  if (ar[n - 1] + ar[n - 2] >= sum)
    printf("YES\n");
  else
    printf("NO\n");
}
int main() {
  solve();
  return 0;
}
