Codeforces Round #446 (Div. 2) A Greed

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 7, maxd = (1<<18)-1, mod = 1000003;
const int INF = 0x7f7f7f7f;

int n;
ll a[maxn];

int main() {

    scanf("%d", &n);
    ll sum = 0;
    for(int i = 0; i < n; ++i) {
        ll x; scanf("%lld", &x);
        sum += x;
    }
    for(int i = 0; i < n; ++i) {
        scanf("%lld", &a[i]);
    }
    sort(a, a+n);
    if(sum <= (a[n-1]+a[n-2]))
        puts("YES");
    else puts("NO");

    return 0;
}