Submission #3815191

---

Source Code Expand

#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long int ll;

int main() {
  int n;
  cin >> n;
  vector<int> A(n), B(n), C(n);
  for (int i = 0; i < n; i++) cin >> A[i];
  for (int i = 0; i < n; i++) cin >> B[i];
  for (int i = 0; i < n; i++) cin >> C[i];
  sort(A.begin(), A.end());
  sort(C.begin(), C.end());

  ll ans = 0;
  for (int i = 0; i < B.size(); i++)
    ans += (lower_bound(ALL(A), B[i]) - A.begin()) *
           (C.end() - upper_bound(ALL(C), B[i]));

  cout << ans << endl;
}

Submission Info

Judge Result