CF1189B.Number Circle

You are given $n$ numbers $a_1, a_2, \ldots, a_n$. Is it possible to arrange them in a circle in such a way that every number is strictly less than the sum of its neighbors?

For example, for the array $[1, 4, 5, 6, 7, 8]$, the arrangement on the left is valid, while arrangement on the right is not, as $5\ge 4 + 1$ and $8 \gt 1 + 6$.

给你 $n$ 个数 $a_1, a_2, \ldots, a_n$。能否将它们排成一个环，使得每个数都严格小于其两个相邻数之和？

例如，对于数组 $[1, 4, 5, 6, 7, 8]$，左侧的排列是合法的，而右侧的排列不合法，因为 $5 \ge 4 + 1$ 且 $8 > 1 + 6$。

The first line contains a single integer $n$ ($3\le n \le 10^5$) — the number of numbers.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \le 10^9$) — the numbers. The given numbers are not necessarily distinct (i.e. duplicates are allowed).

第一行包含一个整数 $n$（$3\le n \le 10^5$）—— 数字的个数。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \le 10^9$）—— 这些数字。给定的数字不一定互不相同（即允许重复）。

If there is no solution, output "NO" in the first line.

If there is a solution, output "YES" in the first line. In the second line output $n$ numbers — elements of the array in the order they will stay in the circle. The first and the last element you output are considered neighbors in the circle. If there are multiple solutions, output any of them. You can print the circle starting with any element.

如果无解，在第一行输出 “NO”。

如果有解，在第一行输出 “YES”；在第二行输出 $n$ 个数——即数组的元素，按其在圆圈中的顺序排列。你所输出的第一个和最后一个元素在圆圈中视为相邻。若存在多个解，输出任意一个即可。你可以从任意一个元素开始输出该圆圈。

One of the possible arrangements is shown in the first example:

$4 \lt 2 + 3$;

$2 \lt 4 + 3$;

$3 \lt 4 + 2$.

One of the possible arrangements is shown in the second example.

No matter how we arrange $13, 8, 5$ in a circle in the third example, $13$ will have $8$ and $5$ as neighbors, but $13\ge 8 + 5$.

There is no solution in the fourth example.

一种可能的排列方式如第一个示例所示：

$4 \lt 2 + 3$；

$2 \lt 4 + 3$；

$3 \lt 4 + 2$。

一种可能的排列方式如第二个示例所示。

在第三个示例中，无论怎样将 $13, 8, 5$ 按环形排列，$13$ 的两个邻数都必为 $8$ 和 $5$，但 $13\ge 8 + 5$。

第四个示例无解。