Submission #1180206

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
void rd(int &x){
  int k, 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;
  }
}
void wt_L(int x){
  char f[10];
  int m=0, s=0;
  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');
  }
}
int A[100000], As, B[100000], Bs, K;
int main(){
  int C, X, Y, i, j, ok;
  rd(As);
  rd(Bs);
  rd(K);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=0;Lj4PdHRW<As;Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  {
    int KL2GvlyY;
    for(KL2GvlyY=0;KL2GvlyY<Bs;KL2GvlyY++){
      rd(B[KL2GvlyY]);
    }
  }
  sort(A, A+As);
  sort(B, B+Bs);
  X = 0;
  Y = 1073709056;
  while(X < Y){
    C = (X+Y) / 2;
    ok = 0;
    i = j = 0;
    while(i < As && j < Bs){
      if( abs(A[i]-B[j]) <= C ){
        ok++;
        i++;
        j++;
        if(ok == K){
          break;
        }
        continue;
      }
      if(A[i] < B[j]){
        i++;
      }
      else{
        j++;
      }
    }
    if(ok >= K){
      Y = C;
    }
    else{
      X = C+1;
    }
  }
  wt_L(X);
  putchar_unlocked('\n');
  return 0;
}
// cLay varsion 20170326-2

Submission Info

Judge Result