codeforces Sereja and Mugs
来源:互联网 发布:node 虚拟主机 编辑:程序博客网 时间:2024/06/05 19:36
Description
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.
Input
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 a1, a2, …, an(1 ≤ ai ≤ 10). Number ai means the volume of the i-th mug.
Output
In a single line, print “YES” (without the quotes) if his friends can play in the described manner, and “NO” (without the quotes) otherwise.
Sample Input
Input
3 4
1 1 1
Output
YES
Input
3 4
3 1 3
Output
YES
Input
3 4
4 4 4
Output
NO
n个数相加减去最大的一个后小于等于m就输出yes;
#include <cstdio>#include <cstring>#include <iostream>using namespace std;int main(){ int n,m; cin>>n>>m; int max=0,s=0; for(int i=0; i<n; i++) { int d; cin>>d; s+=d; if(max<d) max=d; } s-=max; if(s<=m) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0;}
- codeforces Sereja and Mugs
- A. Sereja and Mugs
- A. Sereja and Mugs
- Codeforces Round #243 (Div. 2)——A. Sereja and Mugs
- Codeforces Sereja and Mirroring
- codeforces Sereja and Algorithm
- codeforces --A - Sereja and Algorithm
- codeforces B. Sereja and Contests
- codeforces Sereja and Dima 题解
- codeforces 315 B.Sereja and Array
- CodeForces 315A Sereja and Bottles
- CodeForces 315B Sereja and Array
- Codeforces Round #215_div2_C. Sereja and Algorithm
- CodeForces #230 div2 C Sereja and Prefixes
- Codeforces 380 A. Sereja and Prefixes
- Codeforces 380 C. Sereja and Brackets
- Codeforces 380D Sereja and Cinema
- codeforces 401B - Sereja and Contests
- 深入理解 Context
- JAVA菜鸟学习小计1
- 团队中“螃蟹”太多,如何解决?
- web 中使用 谷歌 zxing.dll 识别二维码实例
- 关于spinlock和mutex的性能差异
- codeforces Sereja and Mugs
- oc 一些常用命令
- POJ2485 Kruskal
- 喝酒不骑马的Android自学日记(8)-D/TPicker实例&GridView实例
- codeforces Police Patrol
- 使用lrun
- mac 搭建 内网微信服务 ngrok
- mount.nfs: an incorrect mount option was specified
- Scala Everything is an object