fork download
  1. #include <bits/stdc++.h>
  2.  
  3. #define NHL mylove();
  4.  
  5. #define fi first
  6. #define se second
  7. #define int long long
  8.  
  9. #define range(i, a, op, n, x) for (int i = a; i op n; i += x)
  10. #define e "\n"
  11.  
  12. #define tieuacma252 signed main
  13.  
  14. #define Furina ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  15. #define NakanoItsuki "RESCUE"
  16. #define NakanoNino freopen(NakanoItsuki".inp", "r", stdin);freopen(NakanoItsuki".out", "w", stdout);
  17. using namespace std;
  18.  
  19. const int maxn = 1e5+5;
  20. int n, m;
  21. int a[maxn], b[maxn];
  22.  
  23. bool check(int x){
  24. for(int i=0; i<n; i++){
  25. int it = lower_bound(b, b+m, a[i]-x) - b;
  26. if(it >= m || b[it] > a[i] + x)
  27. return false;
  28. }
  29. return true;
  30. }
  31.  
  32. void solve(){
  33. cin >> n >> m;
  34. for(int i=0; i<n; i++){
  35. cin >> a[i];
  36. }
  37. for(int i=0; i<m; i++){
  38. cin >> b[i];
  39. }
  40. sort(b, b+m);
  41. int l=1, r=2e9, ans = -1;
  42. while(l <= r) {
  43. int m = (l+r)/2;
  44. if(check(m)){
  45. ans = m;
  46. r = m-1;
  47. }
  48. else
  49. l = m+1;
  50. }
  51. cout << ans;
  52. }
  53.  
  54. tieuacma252() {
  55. Furina
  56. solve();
  57. // NakanoNino
  58. return 0;
  59. }
Success #stdin #stdout 0s 5304KB
stdin
Standard input is empty
stdout
1