Submission #8432355

---

Source Code Expand

#include <bits/stdc++.h>
#define r(i,n) for(long long i = 0; i<n; i++)
typedef long long ll;
using namespace std;

int main() {
  int n,count=0;
  cin >> n;
  vector<int> a(n,0),b(n,0),b2(n,0),c(n,0);
  r(i,n)cin>>a[i];
  r(i,n)cin>>b[i];
  r(i,n)cin>>c[i];
  sort(a.begin(),a.end());
  sort(b.begin(),b.end());
  sort(c.begin(),c.end());
  r(i,n){
    r(j,n){
      if(b[i]<c[j])b2[i]++;
    }
  }
  r(i,n){
    r(j,n){
      if(a[i]<b[j])count+=b2[j];
    }
  }
  cout<<count<<endl;
}

Submission Info

Judge Result