Submission #2992349

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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(B.begin(), B.end()), sort(C.begin(), C.end());

  long long n, ans = 0;
  for (int i = 0; i < N; i++) {
    n = lower_bound(A.begin(), A.end(), B[i]) - A.begin();
    n *= C.end() - upper_bound(C.begin(), C.end(), B[i]);
    ans += n;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result