#include<bits/stdc++.h> #define endl '\n' using namespace std; int main(){ int a[100025],b[100005]; long long n,sum=0; cin>>n;for(int i=1;i<=n;i++)cin>>a[i];for(int i=1;i<=n;i++)cin>>b[i]; sort(a+1,a+n+1);sort( b+1,b+n+1); for(int i=1;i<=n;i++){ if(a[i]>b[n]) break; int id=upper_bound(b+1,b+1+n,a[i])-b; //cout<<id<<endl; sum+=(n-id+1); } cout<<sum; return 0; }