CF1444B Divide and Sum 题解 数数题 思维 数学

Divide and Sum

传送门

You are given an array $a$ of length $2n$ . Consider a partition of array $a$ into two subsequences $p$ and $q$ of length $n$ each (each element of array $a$ should be in exactly one subsequence: either in $p$ or in $q$ ).

Let’s sort $p$ in non-decreasing order, and $q$ in non-increasing order, we can denote the sorted versions by $x$ and $y$ , respectively. Then the cost of a partition is defined as $f(p,q)={\sum }_{i=1}^n|x_i-y_i|$ .

Find the sum of $f(p,q)$ over all correct partitions of array $a$ . Since the answer might be too big, print its remainder modulo $998244353$ .

Input

The first line contains a single integer $n$ ( $1\le n\le 150000$ ).

The second line contains $2n$ integers $a_1,a_2,\dots ,a_{2n}$ ( $1\le a_i\le 10^9$ ) — elements of array $a$ .

Output

Print one integer — the answer to the problem, modulo $998244353$ .

Examples

input #1

1
1 4

output #1

6

input #2

2
2 1 2 1

output #2

12

input #3

3
2 2 2 2 2 2

output #3

0

input #4

5
13 8 35 94 9284 34 54 69 123 846

output #4

2588544

Note

Two partitions of an array are considered different if the sets of indices of elements included in the subsequence $p$ are different.

In the first example, there are two correct partitions of the array $a$ :

1. $p=[1]$ , $q=[4]$ , then $x=[1]$ , $y=[4]$ , $f(p,q)=|1-4|=3$ ;
2. $p=[4]$ , $q=[1]$ , then $x=[4]$ , $y=[1]$ , $f(p,q)=|4-1|=3$ .

In the second example, there are six valid partitions of the array $ a $ :

1. $p=[2,1]$ , $q=[2,1]$ (elements with indices $1$ and $2$ in the original array are selected in the subsequence $p$ );
2. $p=[2,2]$ , $q=[1,1]$ ;
3. $p=[2,1]$ , $q=[1,2]$ (elements with indices $1$ and $4$ are selected in the subsequence $p$ );
4. $p=[1,2]$ , $q=[2,1]$ ;
5. $p=[1,1]$ , $q=[2,2]$ ;
6. $p=[2,1]$ , $q=[2,1]$ (elements with indices $3$ and $4$ are selected in the subsequence $p$ ).

题面翻译

给一个长度为 $2n$ 的数列 $a$，将 $a$ 中的数分为两串长度为 $n$ 的数列 $p$ 和 $q$

$PS:p,q$不一定要是数列 $a$ 中连续的数列。
例： a = { 1 , 2 , 3 , 4 } a=\{1,2,3,4\} a={1,2,3,4}，那么可以为 p = { 1 , 3 } , q = { 4 , 2 } p=\{1,3\},q=\{4,2\} p={1,3},q={4,2}，此时 $f(p,q)=|1-4|+|3-2|=3+1=4$。

我们按非递减的顺序对数列 $p$ 排序，而数列 $q$ 按非递增的顺序排序。然后我们定义 $f(p,q)={\sum }_{i=1}^n|p_i-q_i|$。

求对于所有的 $p,q$ 的 $f(p,q)$ 的值之和。答案对 $998244353$ 取模。

注明

$以上来自CodeForces，翻译来源：洛谷。$

BestMonkey：不调侃了。

解题思路

看题一万年不会，直接推。设假如前 $T$ 个数都满足 $q_i\ge p_i$，$i\in [1,k]$，取最大的 $T$，那么就有：

$$\begin{gathered} \sum _{i=1}^n|p_i-q_i| \\ =\sum _{i=1}^T(q_i-p_i)+\sum _{i=T+1}^n(p_i-q_i) \\ =\sum _{i=1}^T{q}_i-\sum _{i=1}^T{p}_i+\sum _{i=T+1}^n{p}_i-\sum _{i=T+1}^n{q}_i \\ =\sum _{i-1}^n(q_i-p_i)+2\times \sum _{i=1}^T(q_i-p_i) \end{gathered}$$

显然，${\sum }_{i=1}^n(q_i-p_i)=0$，所以原式就可以化为：$2\times {\sum }_{i=1}^T(q_i-p_i)$。

为了满足 $q_i\ge p_i$，$i\in [1,k]$，那么 $q_{1\sim T}$ 就只能取前 $n$ 大的数，$q_{T+1\sim n}$ 只能取前 $n$ 大的数。

现在我们需要知道在前 $n$ 大的数里面选 $T$ 的数的所有方案的 $q_i$ 之和，那么只需要知道每个数出现的次数即可，显然每个数出现的次数都是 $\frac{T\times \left(\begin{array}{c}n\\ T\end{array}\right)}{n}$。

同理可得 ${\sum }_{i=1}^T{p}_i$。

AC Code

#include<bits/stdc++.h>
using namespace std;
char buf[1048576], *p1, *p2;
template<typename T>inline void Super_Quick_Read(T &x) {
	bool f = 1;
	x = 0;
	char ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? 0 : *p1++);
	while (ch < '0' || ch > '9') {
		if (ch == '-') f = !f;
		ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? 0 : *p1++);
	}
	while (ch >= '0' && ch <= '9')x = (x << 1) + (x << 3) + (ch ^ 48), ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? 0 : *p1++);
	x = (f ? x : -x);
	return;
}
template<typename T>inline void Quick_Write(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x > 9) Quick_Write(x / 10);
	putchar(x % 10 + '0');
	return;
}
int n;
long long a[300005];
long long fac[300005], inv[300005], finv[300005];
long long Answer_1, Answer_2;
inline long long C(long long n, long long m) {
	return fac[n] * finv[m] % 998244353 * finv[n - m] % 998244353;
}
signed main() {
	Super_Quick_Read(n), fac[0] = inv[0] = finv[0] = 1, fac[1] = inv[1] = finv[1] = 1;
	for (register int i = 2; i <= n; ++i) fac[i] = fac[i - 1] * i % 998244353, inv[i] = (998244353 - 998244353 / i) * inv[998244353 % i] % 998244353, finv[i] = finv[i - 1] * inv[i] % 998244353;
	for (register int i = 1; i <= n << 1; ++i) Super_Quick_Read(a[i]);
	sort(a + 1, a + (n << 1) + 1);
	long long tot_1 = 0, tot_2 = 0;
	for (register int i = 1; i <= n; ++i) (tot_1 += a[i]) %= 998244353;
	for (register int i = 1; i <= n; ++i) (tot_2 += a[i + n]) %= 998244353;
	for (register int i = 1, temp; i <= n; ++i) temp = C(n, i) % 998244353 * i % 998244353 * inv[n] % 998244353, Answer_1 = (Answer_1 + tot_1 % 998244353 * temp % 998244353 * 2 % 998244353 * C(n, n - i) % 998244353) % 998244353, Answer_2 = (Answer_2 + tot_2 % 998244353 * temp % 998244353 * 2 % 998244353 * C(n, n - i) % 998244353) % 998244353;
	Quick_Write((Answer_2 - Answer_1 + 998244353) % 998244353);
	return 0;
}