Submission #2215323

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1000000007
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define mt make_tuple

ll a[101010], b[101010], c[101010], ans=0;
int n;

int main(){
cin >> n;
rep(i, 0, n-1)cin >> a[i];
rep(i, 0, n-1)cin >> b[i];
rep(i, 0, n-1)cin >> c[i];
sort(a, a+n);
sort(b, b+n);
sort(c,c+n);

rep(i, 0, n-1){
int l = lower_bound(a, a+n, b[i])-a;
int r = upper_bound(c, c+n, b[i])-c;
ans+=1LL*l*(n-r);
}
cout << ans << endl;
return 0;}

Submission Info

Judge Result