As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定两个长度为 $n$ 的数组 $a, b$。
请计算：
$$ \sum_{i=1}^n \sum_{j=1}^n \min(|a_i - a_j|, |b_i - b_j|) $$
第一行一个正整数 $n$ ($1 \leq n \leq 10^5$) 表示数组的长度。
第二行 $n$ 个正整数，表示数组 $a_i$ ($1 \leq a_i \leq 10^6$)。
第三行 $n$ 个正整数，表示数组 $b_i$ ($1 \leq b_i \leq 10^6$)。
一行一个整数表示答案。
2 5 2 2 8
6
5 7 2 8 4 1 2 2 6 4 3
34
对于 $30\%$ 的测试点： $n \leq 1000$。
对于另外 $20\%$ 的测试点： $a_i, b_i \leq 50$。
对于另外 $30\%$ 的测试点： $a_i = b_i$。
对于所有测试点：$1 \leq n \leq 10^5, 1 \leq a_i, b_i \leq 10^6$。
We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.
You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.
STOP! Before you submit an issue, please READ the following guidelines: