fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long ll;
  5. const ll maxN = 1e5 + 36;
  6. ll n, a[maxN], b[maxN], c[maxN];
  7.  
  8. void input() {
  9.     cin >> n;
  10.     for (ll i = 1; i <= n; i++) cin >> a[i];
  11.     for (ll i = 1; i <= n; i++) cin >> b[i];
  12.     for (ll i = 1; i <= n; i++) cin >> c[i];
  13. }
  14.  
  15. ll findmin(ll a[], ll b[], ll c[]) {
  16.     ll ans = 2e18; 
  17.     ll i = 1, k = 1;
  18.     for (ll j = 1; j <= n; j++) {
  19.         while (i < n && a[i+1] <= b[j]) i++;
  20.         while (k < n && c[k] < b[j]) k++;
  21.         if (a[i] <= b[j] && c[k] >= b[j]) {
  22.             ans = min(ans, 2 * (c[k] - a[i]));
  23.         }
  24.     }
  25.     return ans;
  26. }
  27.  
  28. ll solve() {
  29.     ll ans = 2e18;
  30.     ans = min({
  31.         findmin(a, b, c),
  32.         findmin(a, c, b),
  33.         findmin(b, a, c),
  34.         findmin(b, c, a),
  35.         findmin(c, a, b),
  36.         findmin(c, b, a)
  37.     });
  38.     return ans;
  39. }
  40.  
  41. void init() {
  42.     sort(a + 1, a + 1 + n);
  43.     sort(b + 1, b + 1 + n);
  44.     sort(c + 1, c + 1 + n);
  45. }
  46.  
  47. int main() {
  48.     ios_base::sync_with_stdio(0);
  49.     cin.tie(0); cout.tie(0);
  50.  
  51.     input();
  52.     init();
  53.     cout << solve();
  54.  
  55.     return 0;
  56. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin 
Standard input is empty
stdout 
2000000000000000000
https://ideone.com/GdKxzj
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!