处女座的期末考试（贪心）

链接：https://ac.nowcoder.com/acm/contest/327/J

每次都选最先准备的科目复习就行。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;

struct node{
	ll a,b;
}; 

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

node aa[100005];

int main(){
	ll n,sum;
	cin>>n;
	for(int i = 0;i<n;++i)
	cin>>aa[i].a;
	for(int i = 0;i<n;++i)
	cin>>aa[i].b;
	sort(aa,aa+n,cmp);
	int ok = 1;
	sum = 0;
	for(int i = 0;i<n;++i){
		sum += aa[i].a;
		if(sum > aa[i].b){
			ok = 0;
			break;
		}
		sum += 2;
	}
	if(ok == 1)
	cout<<"YES\n";
	else
	cout<<"NO\n";
	return 0;
}