CodeForces 670D Magic Powder

二分。

二分一下答案，然后验证一下。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c=getchar(); x=;
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) {x=x*+c-''; c=getchar();}
}
 
const int maxn=;
LL k,a[maxn],b[maxn];
int n;
 
bool check(LL x)
{
    LL sum=;
    for(int i=;i<=n;i++)
    {
        if(a[i]*x<=b[i]) continue;
        sum=sum+a[i]*x-b[i];
        if(sum>k) return ;
    }
    if(sum<=k) return ;
    return ;
}
 
int main()
{
    scanf("%d%lld",&n,&k);
    for(int i=;i<=n;i++) scanf("%lld",&a[i]);
    for(int i=;i<=n;i++) scanf("%lld",&b[i]);
 
    LL L=,R=3e9,ans;
    while(L<=R)
    {
        LL mid=(L+R)/;
        if(check(mid)) L=mid+,ans=mid;
        else R=mid-;
    }
    printf("%lld\n",ans);
 
    return ;
}