Submission #3815917

---

Source Code Expand

#include <iostream>
#include <string>
#include<algorithm>
#include <vector>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<numeric>
#include<regex>
using namespace std;

typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define MAX 1000000000 // 10^9


int main() {
	int N; cin >> N;
	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];

	// A[i] < B[j] < C[k]

	sort(A, A + N);
	sort(B, B + N);
	sort(C, C + N);

	ll ans = 0;

	for (int i = 0; i < N; i++) {
		int* it1 = lower_bound(A, A + N, B[i]); 
		int* it2 = upper_bound(C, C + N, B[i]); 
		ans += (it1 - A) * ((C + N) - it2);
	}
	cout << ans << endl;


	return 0;
}

Submission Info

Judge Result