C. The Delivery Dilemma（二分答案）

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+100;
int a[N],b[N];
vector<int> v;
int n;
bool check(ll x){
	v.clear();
	for(int i=0;i<n;i++){
		if(a[i]<=x) continue;
		else v.push_back(i);
	}
	ll sum=0;
	for(int i=0;i<v.size();i++){
		sum+=b[v[i]];
	}	
	if(sum<=x) return true;
	else return false;
}
int main(){
	int T;scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		ll l=0,r=0;
		for(int i=0;i<n;i++) scanf("%d",&a[i]);
		for(int i=0;i<n;i++){
			scanf("%d",&b[i]);
			r=r+b[i];
		}
		while(l<r){
			ll mid=(l+r)/2;
			if(check(mid)){
				r=mid;
			}
			else l=mid+1;
		}
		printf("%lld\n",l);
	}
	return 0;
}