892A. Greed#贪婪（优先队列priority_queue）

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int main(){
    priority_queue< long long,vector<long long >,less<long long > >cap;
    long long n;    cin>>n;
    long long  sum=0;
    for(long long  i=0;i<n;i++){
        long long  rem; cin>>rem;
        sum+=rem;
    }
    while(n--){
        long long vol; cin>>vol;
        cap.push(vol);
    }
    long long  sumt = cap.top(); cap.pop();
    sumt+=cap.top();
    if(sum>sumt)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
    return 0;
}