Ah, Tenshi!

题号：NC232324
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld

题目描述

Tenshi is a CS student in SUSTech with an initial coding level $C(1\leq C\leq 10^9)$ .

Tenshi meets $N(1\leq N\leq 10^6)$ coders in the campus, the $i^{th}$ of which has a coding level $a_i(1\leq a_i\leq 10^9)$ .

He can choose to challenge some or all of these $N$ coders in any order he wants.

If his current coding level is greater than the coder he challenges, Tenshi's coding level will be increased by that coder's coding level.

Tenshi can challenge each coder at most once.

Tenshi would be grateful if you tell him the maximum coding level he can achieve.

The input consists of:

One line containing two integers $N, C$ seperated by a space.

One line containing $N$ integers $a_1, a_2, \dots, a_N$ seperated by spaces.

Output a single integer indicating the maximum coding level Tenshi can achieve.

示例1

复制

5 2
3 1 15 2 2

复制