# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

My friend, Qbaidul recently claimed again that he is stronger than a Yeti. But this time no one believed him. So, he decided to beat a Yeti for real. He has a team consisting of `$n$`

members. Each member has `$a_i$`

power.

His team went to the Himalayas to find a Yeti, and they found one too. This Yeti has `$X$`

life. If his team wants to beat this Yeti, their total power must be strictly greater than the life of Yeti. If they can’t beat this Yeti, Yeti will beat all of them.

Can you tell me whether they will beat this Yeti or not.

First line contains two integers `$n$`

(`$1 \le n \le 10$`

), the number of members on his team, and `$X$`

(`$1 \le X \le 100$`

), the life of Yeti.

Next line contains `$n$`

integers (`$0 \le a_1, a_2, ..., a_n \le 10$`

), where `$a_i$`

represents the power of the `$i^th$`

member.

Print `$\texttt{Yes}$`

if they can beat the Yeti, otherwise print `$\texttt{No}$`

.

Input | Output |
---|---|

3 5 1 2 3 | Yes |

97% Solution Ratio

iammarajulEarliest,

iammarajulFastest, 0.0s

TusharCSE035Lightest, 0 B

mdvirusShortest, 86B

Login to submit