#include <bits/stdc++.h>
using pair = std::pair<long, long>;
int main() {
  long n;
  std::cin >> n;
  n *= 2;
  std::vector<long> cans;
  while (n--) {
    long c;
    std::cin >> c;
    cans.push_back(c);
  }
  long sz = cans.size() / 2;
  std::vector<pair> cans_cap;
  for (int x = 0; x < sz; ++x) {
    cans_cap.push_back({cans[x], cans[x + sz]});
  }
  std::sort(cans_cap.begin(), cans_cap.end(),
            [](pair a, pair b) { return a.second > b.second; });
  long long vol = 0;
  for (auto p : cans_cap) {
    vol += p.first;
  }
  long a = cans_cap[0].second;
  long b = cans_cap[1].second;
  if ((a + b) >= vol) {
    std::cout << "YES\n";
  } else {
    std::cout << "NO\n";
  }
}
