CF1061B.Views Matter

You came to the exhibition and one exhibit has drawn your attention. It consists of $n$ stacks of blocks, where the $i$-th stack consists of $a_i$ blocks resting on the surface.

The height of the exhibit is equal to $m$. Consequently, the number of blocks in each stack is less than or equal to $m$.

There is a camera on the ceiling that sees the top view of the blocks and a camera on the right wall that sees the side view of the blocks.

Find the maximum number of blocks you can remove such that the views for both the cameras would not change.

Note, that while originally all blocks are stacked on the floor, it is not required for them to stay connected to the floor after some blocks are removed. There is no gravity in the whole exhibition, so no block would fall down, even if the block underneath is removed. It is not allowed to move blocks by hand either.

你来到了一场展览，其中一件展品引起了你的注意。该展品由 $n$ 列积木堆组成，第 $i$ 列积木堆包含 $a_i$ 个积木，全部放置在地面上。

展品的高度为 $m$。因此，每列积木堆中的积木数量均不超过 $m$。

天花板上安装有一台相机，用于拍摄积木的俯视图；右侧墙壁上也安装有一台相机，用于拍摄积木的侧视图。

求最多可以移除多少个积木，使得两台相机所拍摄到的视图均保持不变。

注意：虽然最初所有积木均堆放在地面上，但在移除部分积木后，剩余积木并不需要始终与地面保持接触。整个展览中不存在重力，因此即使下方的积木被移除，上方的积木也不会下落。此外，也不允许手动移动积木。

The first line contains two integers $n$ and $m$ ($1 \le n \le 100\,000$, $1 \le m \le 10^9$) — the number of stacks and the height of the exhibit.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le m$) — the number of blocks in each stack from left to right.

第一行包含两个整数 $n$ 和 $m$（$1 \le n \le 100\,000$，$1 \le m \le 10^9$）—— 分别表示栈的数量和展品的高度。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le m$）—— 表示从左到右每个栈中的方块数量。

Print exactly one integer — the maximum number of blocks that can be removed.

输出一个整数——可移除的方块的最大数量。

The following pictures illustrate the first example and its possible solution.

Blue cells indicate removed blocks. There are $10$ blue cells, so the answer is $10$.

以下图片展示了第一个示例及其可能的解法。

蓝色格子表示被移除的方块。共有 $10$ 个蓝色格子，因此答案为 $10$。