#include <bits/stdc++.h>
using namespace std;
long long b[100061];
long long n, s = 0, k, m;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> k;
    s += k;
  }
  for (int i = 1; i <= n; i++) cin >> b[i];
  sort(b + 1, b + n + 1);
  n = b[n - 1] + b[n];
  if (n >= s)
    cout << "YES";
  else
    cout << "NO";
}
