Submission #3819530

---

Source Code Expand

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

int main()
{
	lint N;
	vector<lint> A,B,C;
	lint a,c;
	lint ans=0;
	
	cin >> N;
	A.resize(N);
	B.resize(N);
	C.resize(N);
	for(lint i=0;i<N;i++)
		cin >> A[i];
	for(lint i=0;i<N;i++)
		cin >> B[i];
	for(lint i=0;i<N;i++)
		cin >> C[i];
	
	sort(A.begin(),A.end());
	sort(B.begin(),B.end());
	sort(C.begin(),C.end());
	
	for(lint i=0;i<N;i++)
	{
		a=lower_bound(A.begin(),A.end(),B[i])-A.begin();
		c=C.end()-lower_bound(C.begin(),C.end(),B[i]+1);
		ans+=a*c;
		cout << a << "*" << c << "=" << a*c << endl;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result