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 ≤ 109) — the number of ingredients and the number of grams of the magic powder.
The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 109), 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 b1, b2, ..., bn (1 ≤ bi ≤ 109), 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
1 1000000000 1 1000000000
2000000000
10 1 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1 1 1 1 1 1 1 1 1 1
0
3 1 2 1 4 11 3 16
4
4 3 4 3 5 6 11 12 14 20
3
就是给出做饼干所需的原料,和已有的原料,还有魔法粉,1单位魔法粉可以转化为1单位任何种类的原料,二分就可以了
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define maxn 500005
#define eps 2e9
__int64 a[maxn], b[maxn];//为了省事,全部都用__int64了
void two(__int64 n, __int64 k){
__int64 ans, s = 0, e = eps, m, ok = 0;
while(e >= s){
m = (e+s) >> 1;
ans = 0;
for(__int64 i = 0; i < n; i++){
ans += a[i]*m - b[i] <= 0 ? 0 : a[i]*m - b[i];//做m块饼干,判断所需的各原料减去已有的原料和,就是所需的魔法粉
if(ans > k){
break;
}
}
if(ans == k){//再判断魔法粉就可以了
printf("%I64d\n", m);
ok++;
break;
}
if(ans < k){
s = m+1;
}
else{
e = m-1;
}
}
if(!ok){
printf("%I64d\n", e);
}
}
int main(){
__int64 n, k;
scanf("%I64d%I64d", &n, &k);
for(int i = 0; i < n; i++){
scanf("%I64d", &a[i]);
}
for(int i = 0; i < n; i++){
scanf("%I64d", &b[i]);
}
two(n, k);
return 0;
}