n,s = list(map(int, input().split()))
lst = list(map(int, input().split()))
lst.sort()
for i in range(n-1):
s-=lst[i]
if s>=0:
print('YES')
else:
print('NO')#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,s,c=0;
cin>>n>>s;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=0;i<n-1;i++)
{
c=c+a[i];
}
if(s>=c)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}1205A - Almost Equal | 1020B - Badge |
1353A - Most Unstable Array | 770A - New Password |
1646B - Quality vs Quantity | 80A - Panoramix's Prediction |
1354B - Ternary String | 122B - Lucky Substring |
266B - Queue at the School | 1490A - Dense Array |
1650B - DIV + MOD | 1549B - Gregor and the Pawn Game |
553A - Kyoya and Colored Balls | 1364A - XXXXX |
1499B - Binary Removals | 1569C - Jury Meeting |
108A - Palindromic Times | 46A - Ball Game |
114A - Cifera | 776A - A Serial Killer |
25B - Phone numbers | 1633C - Kill the Monster |
1611A - Make Even | 1030B - Vasya and Cornfield |
1631A - Min Max Swap | 1296B - Food Buying |
133A - HQ9+ | 1650D - Twist the Permutation |
1209A - Paint the Numbers | 1234A - Equalize Prices Again |