Submission #8239271

---

Source Code Expand

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  sort(a, a+N);
}
template<class T1> void rsortA_L(int N, T1 a[], void *mem = wmem){
  sortA_L(N, a, mem);
  reverse(a, a+N);
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S divup_L(S a, T b){
  return (a+b-1)/b;
}
int N;
long long K;
int A[200000];
int F[200000];
int main(){
  wmem = memarr;
  long long res;
  long long r;
  long long nd;
  rd(N);
  rd(K);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  {
    int KL2GvlyY;
    for(KL2GvlyY=(0);KL2GvlyY<(N);KL2GvlyY++){
      rd(F[KL2GvlyY]);
    }
  }
  sortA_L(N,A);
  rsortA_L(N,F);
  long long Q5VJL1cS;
  long long e98WHCEY;
  long long cTE1_r3A;
  Q5VJL1cS = 0;
  e98WHCEY = 1000000000000LL;
  while(Q5VJL1cS < e98WHCEY){
    int i;
    if((Q5VJL1cS + e98WHCEY)%2==0){
      cTE1_r3A = (Q5VJL1cS + e98WHCEY) / 2;
    }
    else{
      cTE1_r3A = (Q5VJL1cS + e98WHCEY - 1) / 2;
    }
    r = K;
    for(i=(0);i<(N);i++){
      nd = (long long) A[i] * F[i] - cTE1_r3A;
      if(nd > 0){
        r -=divup_L(nd,F[i]);
      }
    }
    if(r >= 0){
      e98WHCEY = cTE1_r3A;
    }
    else{
      Q5VJL1cS = cTE1_r3A + 1;
    }
  }
  res =e98WHCEY;
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20191027-1

// --- original code ---
// int N; ll K; int A[2d5], F[2d5];
// {
//   ll res, r, nd;
//   rd(N,K,A(N),F(N));
//   sortA(N,A);
//   rsortA(N,F);
//   res = bsearch_min[ll,x,0,1d12][
//     r = K;
//     rep(i,N){
//       nd = (ll) A[i] * F[i] - x;
//       if(nd > 0) r -= nd /+ F[i];
//     }
//   ](r >= 0);
//   wt(res);
// }

Submission Info

Judge Result