#include <bits/stdc++.h>
using namespace std;
int main() {
  pair<long long int, long long int> a[100005];
  long long int n, i, j, k, cap = 0, rem = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i].second;
  }
  for (i = 0; i < n; i++) {
    cin >> a[i].first;
  }
  sort(a, a + n);
  for (i = 0; i < (n - 2); i++) {
    rem += a[i].second;
  }
  cap = a[n - 1].first + a[n - 2].first - a[n - 1].second - a[n - 2].second;
  if (rem <= cap) {
    cout << "YES";
  } else {
    cout << "NO";
  }
  return 0;
}
