fork download 
  1. #include <bits/stdc++.h>
  2. #define int long long
  3. #define ll long long
  4. #define fi first
  5. #define se second
  6. #define all(x) x.begin(), x.end()
  7. #define sz(x) (int)x.size()
  8. #define pb push_back
  9. #define re exit(0);
  10. #define FOR(i, a, b)   for(int i = (a), _b = (b); i <= _b; i++)
  11. #define FORD(i, a, b)  for(int i = (a), _b = (b); i >= _b; i--)
  12. #define LOOP(a)        for(int i = 0, _a = (a); i < _a; i++)
  13. #define left (id<<1)
  14. #define right (id<<1|1)
  15. #define _lower(v, x) lower_bound(v.begin(), v.end(), x) - v.begin() + 1
  16.  
  17. using namespace std;
  18.  
  19. typedef vector<int> vi;
  20. typedef pair<int, int> pii;
  21. typedef vector<pii> vii;
  22.  
  23. template<typename T> void chkmin(T &x, T y) {if (y < x) x = y;}
  24. template<typename T> void chkmax(T &x, T y) {if (y > x) x = y;}
  25.  
  26. const int mod = 1e9 + 7;
  27. void add(int &a, int b) {
  28.     a += b;
  29.     if (a >= mod) a -= mod;
  30.     if (a < 0) a += mod;
  31. }
  32.  
  33. int _pow(int a, int b) {
  34.    int ans = 1;
  35.    while (b) {
  36.    if (b % 2 == 1) ans = 1ll * ans * a % mod;
  37.         a = 1ll * a * a % mod;
  38.         b /= 2;
  39.    }
  40.    return ans;
  41. }
  42.  
  43. //--------------------------------------------------------------------------------------------------------------------------------------
  44.  
  45. const int maxn = 2e5;
  46. int a[maxn + 5], b[maxn + 5];
  47. int n;
  48.  
  49. signed main() {
  50.     ios::sync_with_stdio(0);
  51.     cin.tie(0);
  52.     #define name "BADMINTON"
  53.     if (fopen(name".inp", "r")) {
  54.         freopen(name".inp", "r", stdin);
  55.         freopen(name".out", "w", stdout);
  56.     }
  57.  
  58.     cin >> n;
  59.     for (int i = 1; i <= n; i++) cin >> a[i];
  60.     for (int i = 1; i <= n; i++) cin >> b[i];
  61.  
  62.     vi v;
  63.     for (int i = 1; i <= n; i++) v.pb(b[i] - a[i]);
  64.     sort(all(v));
  65.  
  66.     ll res = 0;
  67.     for (int i = 1; i <= n; i++) {
  68.         res += lower_bound(all(v), a[i] - b[i]) - v.begin();
  69.         if (a[i] - b[i] > b[i] - a[i]) res--;
  70.     }
  71.  
  72.     res /= 2;
  73.     cout << res;
  74.  
  75.     return 0;
  76. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/qRQvSy
language:
C++ (gcc 8.3)
created:
17 days 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!