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