90分,WA了两点,求助大佬
查看原帖
90分,WA了两点,求助大佬
873786
wangjiajinself楼主2023/8/4 13:38
#include <iostream>
using namespace std;
const int N=2e6+1;
int n;
unsigned long long h[N],a[N],sum=0,s=0,r=10000000000000000,ans=0,mid,S,L,l=0;
bool check(unsigned long long mid)
{
	sum=0;
	for(int i=1;i<=n;i++) 
	{
		s=a[i]*mid+h[i];
		if(s>=L) sum+=s;
	}
	return sum>=S; 
}
int main()
{
	cin>>n>>S>>L;
	for(int i=1;i<=n;i++) cin>>h[i];
	for(int i=1;i<=n;i++) cin>>a[i];
	while(l+1<r)
	{
		mid=(l+r)/2;
		if(check(mid)) 
		{
			ans=mid;
			r=mid;
		}
		else l=mid;
	}
	cout<<ans;
	return 0;
###### }
2023/8/4 13:38
加载中...