Submission #2817597

---

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());

    int rst = 0;
    for(auto i : B) {
        cout << endl;
        int a_b = lower_bound(A.begin(), A.end(), i) - A.begin();
        // cout << i << " " << a_b << endl;
        int b_c = C.end() - upper_bound(C.begin(), C.end(), i); 
        // cout << i << " " << b_c << endl;
        rst += a_b * b_c;
        // cout << endl;
    }
    cout << rst << endl;
}

Submission Info

Judge Result