The next lecture in a high school requires two topics to be discussed. The ii-th topic is interesting by aiai units for the teacher and by bibi units for the students.
The pair of topics ii and jj (i<ji<j) is called good if ai+aj>bi+bjai+aj>bi+bj (i.e. it is more interesting for the teacher).
Your task is to find the number of good pairs of topics.
Input
The first line of the input contains one integer nn (2≤n≤2⋅1052≤n≤2⋅105) — the number of topics.
The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109), where aiai is the interestingness of the ii-th topic for the teacher.
The third line of the input contains nn integers b1,b2,…,bnb1,b2,…,bn (1≤bi≤1091≤bi≤109), where bibi is the interestingness of the ii-th topic for the students.
Output
Print one integer — the number of good pairs of topic.
Examples
input
Copy
5 4 8 2 6 2 4 5 4 1 3
output
Copy
7
input
Copy
4 1 3 2 4 1 3 2 4
output
Copy
0
思路:
若设定新的数组,c[i] = a[i]-b[i],其实题目可以看成找出c[i]+c[j]>0有多少对,那其实直接排序,二分就行,然后/2去重,至于为什么/2,大家可以用[1,2,3]两两相匹对,看组成的点对中重复情况