#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1e18;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
  int n;
  scanf("%d", &n);
  vector<long long> remain(n), disp(n);
  long long total = 0LL;
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &remain[i]);
    total += remain[i];
  }
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &disp[i]);
  }
  sort(disp.begin(), disp.end());
  int best = disp[n - 1] + disp[n - 2];
  if (best < total)
    puts("NO");
  else
    puts("YES");
  return 0;
}
