Submission #8448798

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for(int i = 0; i < N; i++){
        cin >> A[i];
    }
    vector<int> B(N);
    for(int i = 0; i < N; i++){
        cin >> B[i];
    }
    vector<int> C(N);
    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 sum = 0;
    for(int bi = 0; bi < N; bi++){
        decltype(A)::iterator itA = lower_bound(A.begin(), A.end(), B[bi]);
        int a = itA - A.begin();
        decltype(C)::iterator itC = upper_bound(C.begin(), C.end(), B[bi]);
        int c = C.end() - itC;
        sum += a * c;
    }
    cout << sum << endl;
    return 0;
}

Submission Info

Judge Result