Submission #2536129

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int Nmax = 100010;
int N;
int A[Nmax], B[Nmax], C[Nmax];
int cnt[Nmax];

int main() {
	cin >> 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, A + N); 
	sort(B, B + N); 
	sort(C, C + N);
	
	for (int i = 0; i < N; i++) {
		cnt[i] = N - (upper_bound(C, C + N, B[i]) - C);
	}
	for (int i = N - 1; i > 0; i--) {
		cnt[i - 1] += cnt[i];
	}

	int ans = 0;
	for (int i = 0; i < N; i++) {
		ans += cnt[upper_bound(B,B+N,A[i])-B];
	}

	cout << ans << endl;
}

Submission Info

Judge Result