#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
long long a[maxn];
long long b[maxn];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    priority_queue<long long> pq;
    while (!pq.empty()) pq.pop();
    long long suma = 0, p = 0, q = 0;
    for (int i = 0; i < n; i++) {
      scanf("%lld", &a[i]);
      suma += a[i];
    }
    for (int i = 0; i < n; i++) {
      scanf("%lld", &b[i]);
      pq.push(b[i]);
    }
    p = pq.top();
    pq.pop();
    q = pq.top();
    if (p + q >= suma)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
