Advertisement
7oSkaaa

D - Choose best opponent for Batman

Aug 13th, 2022
850
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.84 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  7. #define fixed(n) fixed << setprecision(n)
  8. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  9. #define fill(vec, value) memset(vec, value, sizeof(vec));
  10. #define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
  11. #define add_mod(a, b, m) (((a % m) + (b % m)) % m)
  12. #define all(vec) vec.begin(), vec.end()
  13. #define rall(vec) vec.rbegin(), vec.rend()
  14. #define sz(x) int(x.size())
  15. #define debug(x) cout << #x << ": " << (x) << "\n";
  16. #define fi first
  17. #define se second
  18. #define ll long long
  19. #define ull unsigned long long
  20. #define Mod  1'000'000'007
  21. #define OO 2'000'000'000
  22. #define EPS 1e-9
  23. #define PI acos(-1)
  24. template < typename T = int > using Pair = pair < T, T >;
  25. vector < string > RET = {"NO", "YES"};
  26.  
  27. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  28.     for (auto &x : v) in >> x;
  29.     return in;
  30. }
  31.  
  32. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  33.     for (const T &x : v) out << x << ' ';
  34.     return out;
  35. }
  36.  
  37. void Solve(){
  38.     int n, m;
  39.     cin >> n >> m;
  40.     vector < ll > a(n), b(m);
  41.     cin >> a >> b;
  42.     sort(all(a));
  43.     sort(all(b));
  44.     ll max_ans = 4e9;
  45.     int i = 0, j = 0;
  46.     while(i < n){
  47.         while(j < m && b[j] < a[i])
  48.             max_ans = min(max_ans, abs(a[i] - b[j++]));
  49.         if(j < m)
  50.             max_ans = min(max_ans, abs(a[i] - b[j]));
  51.         i++;
  52.     }
  53.     cout << max_ans << "\n";
  54. }
  55.  
  56. int main(){
  57.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  58.     int t = 1;
  59.     cin >> t;
  60.     while(t--)
  61.         Solve();
  62.     return 0;
  63. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement