codeforce 670D2 Magic Powder - 2

 Magic Powder - 2

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

The term of this problem is the same as the previous one, the only exception — increased restrictions.

Input

The first line contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 10⁹) — the number of ingredients and the number of grams of the magic powder.

The second line contains the sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where the i-th number is equal to the number of grams of the i-th ingredient, needed to bake one cookie.

The third line contains the sequence b₁, b₂, ..., b_n (1 ≤ b_i ≤ 10⁹), where the i-th number is equal to the number of grams of the i-th ingredient, which Apollinaria has.

Output

Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.

Sample Input

Input

1 1000000000
1
1000000000

Output

2000000000

Input

10 1
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
1 1 1 1 1 1 1 1 1 1

Output

0

Input

3 1
2 1 4
11 3 16

Output

4

Input

4 3
4 3 5 6
11 12 14 20

Output

3

查找做成的个数，判断在此个数的时候，总原料是否够用，进而确定能做多少个

代码：

#include <iostream>
#include<cstdio>
#define MAXN 10000000000
using namespace std;
long long n,k;
long long a[100000+10],b[100000+10];
bool judge(long long mid)
{
    long long temp=k;
    for(int i=0;i<n;i++)
    {
        if(a[i]*mid>b[i])//注意细节
            temp-=a[i]*mid-b[i];
        if(temp<0)
            return 0;
    }
    return true;
}
int main()
{
    scanf("%lld%lld",&n,&k);
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&b[i]);
    }
    long long l=0,r=MAXN,mid;
    long long ans=0;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(judge(mid))
        {
            ans=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    printf("%lld\n",ans);
    return 0;
}