CF426A.Sereja and Mugs

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and $n$ water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.

As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has $(n-1)$ friends. Determine if Sereja's friends can play the game so that nobody loses.

输入格式

The first line contains integers $n$ and $s$ $(2<=n<=100; 1<=s<=1000)$ — the number of mugs and the volume of the cup. The next line contains $n$ integers $a_{1}$ , $a_{2}$ , $...$ , $a_{n}$ $(1<=a_{i}<=10)$ . Number $a_{i}$ means the volume of the $i$ -th mug.

输出格式

In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.

输入输出样例

输入#1
```
3 4
1 1 1
```
输出#1
```
YES
```
输入#2
```
3 4
3 1 3
```
输出#2
```
YES
```
输入#3
```
3 4
4 4 4
```
输出#3
```
NO
```

首页