Submission #3819614

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
typedef long long lint;
using namespace std;

int main()
{
	int N;
	int A[100010],B[100010],C[100010];
	lint a,c;
	lint ans=0;
	
	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++)
	{
		a=lower_bound(A,A+N,B[i])-A;
		c=C+N-upper_bound(C,C+N,B[i]);
		ans+=a*c;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result