#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int n; cin >> n; int a[n]; rep(i,n)cin >> a[i]; int sum[110] = {}; rep(i,n){ int b; cin >> b; sum[b] += a[i]; } int flag = 1; srep(i,1,110){ if(sum[0] < sum[i])flag = 0; } if(flag)yn; return 0; }