CF1725B.Basketball Together

A basketball competition is held where the number of players in a team does not have a maximum or minimum limit (not necessarily $5$ players in one team for each match). There are $N$ candidate players in the competition that will be trained by Pak Chanek, the best basketball coach on earth. The $i$-th candidate player has a power of $P_i$.

Pak Chanek will form zero or more teams from the $N$ candidate players on the condition that each candidate player may only join in at most one team. Each of Pak Chanek's teams will be sent to compete once with an enemy team that has a power of $D$. In each match, the team sent is said to defeat the enemy team if the sum of powers from the formed players is strictly greater than $D$.

One of Pak Chanek's skills is that when a team that has been formed plays in a match, he can change the power of each player in the team to be equal to the biggest player power from the team.

Determine the maximum number of wins that can be achieved by Pak Chanek.

举办了一场篮球比赛，每支队伍的球员人数没有上限或下限（即每场比赛的队伍不一定恰好有 $5$ 名球员）。共有 $N$ 名候选球员参加本次比赛，他们将由地球上最优秀的篮球教练 Pak Chanek 进行训练。第 $i$ 名候选球员的力量值为 $P_i$。

Pak Chanek 将从这 $N$ 名候选球员中组成零支或多支队伍，且每名候选球员至多只能加入一支队伍。Pak Chanek 组成的每一支队伍都将各出战一次，对阵一支力量值为 $D$ 的敌方队伍。在每场比赛中，若我方队伍所有球员的力量值之和严格大于 $D$，则称该队击败了敌方队伍。

Pak Chanek 拥有一项特殊技能：当一支已组成的队伍参加比赛时，他可将该队中每名球员的力量值均改为该队中最高的力量值。

请确定 Pak Chanek 最多能取得多少场胜利。

The first line contains two integers $N$ and $D$ ($1 \le N \le 10^5$, $1 \le D \le 10^9$) — the number of candidate players and the power of the enemy team.

The second line contains $N$ integers $P_1, P_2, \ldots, P_N$ ($1 \le P_i \le 10^9$) — the powers of all candidate players.

第一行包含两个整数 $N$ 和 $D$（$1 \le N \le 10^5$，$1 \le D \le 10^9$）—— 分别表示候选选手人数和敌方队伍的战力。

第二行包含 $N$ 个整数 $P_1, P_2, \ldots, P_N$（$1 \le P_i \le 10^9$）—— 表示所有候选选手的战力。

A line containing an integer representing the maximum number of wins that can be achieved by Pak Chanek.

一个包含整数的行，表示 Pak Chanek 能够取得的最大获胜次数。

The $1$-st team formed is a team containing players $4$ and $6$. The power of each player in the team becomes $100$. So the total power of the team is $100 + 100 = 200 \gt 180$.

The $2$-nd team formed is a team containing players $1$, $2$, and $5$. The power of each player in the team becomes $90$. So the total power of the team is $90 + 90 + 90 = 270 \gt 180$.

第 $1$ 支组建的队伍由玩家 $4$ 和 $6$ 组成。该队中每位玩家的能力值变为 $100$，因此该队的总能力值为 $100 + 100 = 200 \gt 180$。

第 $2$ 支组建的队伍由玩家 $1$、$2$ 和 $5$ 组成。该队中每位玩家的能力值变为 $90$，因此该队的总能力值为 $90 + 90 + 90 = 270 \gt 180$。