Codeforces Round #243 (Div. 2)——A. Sereja and Mugs
来源:互联网 发布:朝鲜和韩国知乎 编辑:程序博客网 时间:2024/06/03 18:10
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 a1, a2, ..., an (1 ≤ ai ≤ 10). Number ai 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.
3 41 1 1
YES
3 43 1 3
YES
3 44 4 4
NO
有很多n个小杯,1大杯,每个小杯的容积以及大杯的容积都知道了,每个人拿一个非空的小杯,把水全部倒大杯里,如果谁倒的时候大杯满了,谁就输,然后她的(n-1)个朋友要玩儿,问你有没有一种倒水的方法使得没有人会输,如果没有输出NO。
#include <iostream>#include<algorithm>using namespace std;int main(){ int n,s,a[105]; while(cin>>n>>s) { for(int i=0; i<n; i++) { cin>>a[i]; } sort(a,a+n); int sum=0; int flag=0; for(int i=0; i<n-1; i++) { sum+=a[i]; if(sum>s) { flag=1; break; } } if(flag) cout<<"NO"<<endl; else cout<<"YES"<<endl; } return 0;}
- Codeforces Round #243 (Div. 2)——A. Sereja and Mugs
- Codeforces Round #243 (Div. 2)——Sereja and Swaps
- Codeforces Round #243 (Div. 2)——Sereja and Table
- codeforces Sereja and Mugs
- A. Sereja and Mugs
- A. Sereja and Mugs
- Codeforces Round #243 (Div. 1)——Sereja and Squares
- Codeforces Round #223 (Div. 2)——A. Sereja and Dima
- Codeforces Round #243 (Div. 1) A Sereja and Swaps
- Codeforces Round #215 (Div. 2) -A. Sereja and Coat Rack
- Codeforces Round #215 (Div. 2) A. Sereja and Coat Rack
- Codeforces Round #223 (Div. 2)--A. Sereja and Dima
- Codeforces Round #223 (Div. 2)A. Sereja and Dima&&B. Sereja and Stairs
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2)-C. Sereja and Swaps(multiset)
- Sereja and Algorithm -----Codeforces Round #215 div.1 A
- Codeforces Round #223 (Div. 1) A - Sereja and Prefixes
- 九度 1035 并查集相关
- 排序算法(一)基础概览
- 理解PHP的错误信息大全
- hdu 1031
- hdu(素数的简单应用)
- Codeforces Round #243 (Div. 2)——A. Sereja and Mugs
- 新视野大学英语听说教程4答案
- 用反射设计框架的好处?
- __block的作用
- 链表算法三之静态链表
- Leetcode:Container with most water 最大蓄水量
- 编译原理学习导论
- iOS开发常用数学函数 收藏之用
- eclipse 常见问题解决之道