func_code_string: #include <bits/stdc++.h>   std::mt19937_64 rng(       std::chrono::steady_clock::now().time_since_epoch().count());   long long int myRand(long long int R) {     long long int val = rng() % R;     assert(val >= 0);     return val;   }   const long double PI = atan(1.0) * 4;   const int32_t INF32 = 2e9 + 7;   const int64_t INF64 = 3e18;   const int32_t LOG = 21;   const int32_t MOD = 1e9 + 7;   using namespace std;   void my_debugger(string second, long long int LINE_NUM) { cerr <<   n ; }   template <typename start, typename... end>   void my_debugger(string second, long long int LINE_NUM, start x, end... y) {     if (second.back() !=  , ) {       second +=  , ;       cerr <<  LINE(  << LINE_NUM <<  ):  ;     }     long long int i = second.find( , );     cerr << second.substr(0, i) <<   =   << x;     second = second.substr(i + 1);     if (!second.empty()) cerr <<  ,  ;     my_debugger(second, LINE_NUM, y...);   }   int32_t main() {     ios_base::sync_with_stdio(false), cin.tie(nullptr);     long long int tests = 1;     for (long long int ii = 0; ii < (long long int)tests; ii++) {       vector<long long int> a(6);       for (long long int i = 0; i < (long long int)6; i++) cin >> a[i];       long long int n;       cin >> n;       vector<long long int> b(n);       for (long long int i = 0; i < (long long int)n; i++) cin >> b[i];       long long int ans = 2e9;       vector<pair<long long int, long long int> > v;       for (long long int fret = 0; fret < (long long int)6; fret++) {         for (long long int i = 0; i < (long long int)n; i++) {           long long int x = b[i] - a[fret];           v.push_back({b[i] - a[fret], i});         }       }       sort(v.begin(), v.end());       long long int siz = v.size();       vector<long long int> cnt(n, 0);       long long int cur = 0;       long long int tot = 0;       for (long long int i = 0; i < (long long int)v.size(); i++) {         while (cur < siz && tot < n) {           cnt[v[cur].second]++;           if (cnt[v[cur].second] == 1) tot++;           cur++;         }         if (tot == n) ans = min(ans, v[cur - 1].first - v[i].first);         cnt[v[i].second]--;         if (cnt[v[i].second] == 0) tot--;       }       cout << ans <<   n ;     }     return 0;   }   