#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int main() {
  int n;
  int a[maxn];
  int b[maxn];
  scanf("%d", &n);
  long long a_sum = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a_sum += (long long)a[i];
  }
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  sort(b, b + n);
  if (a_sum <= (long long)b[n - 1] + (long long)b[n - 2])
    printf("YES\n");
  else
    printf("NO\n");
}
