牛客寒假算法基础集训营2 J. 处女座的期末复习(思维)

#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct Node{
	int x,y;
}Edge[100005];
int n;

bool cmp(Node a,Node b){
	return a.y < b.y;
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&Edge[i].x);
	}
	for(int j=1;j<=n;j++){
		scanf("%d",&Edge[j].y);
	}
	int ans = 0;
	sort(Edge+1,Edge+1+n,cmp);
	for(int i=1;i<=n;i++){
		ans += Edge[i].x;
		if(ans > Edge[i].y){
			puts("NO");
			return 0;
		}
		ans += 2;
	}
	puts("YES");
  return 0;
}