CodeForces - 426A(排序)
来源:互联网 发布:舞蹈培训网络推广方案 编辑:程序博客网 时间:2024/05/16 11:50
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
3 4
1 1 1
YES
3 4
3 1 3
YES
3 4
4 4 4
NO
Source
题意:一个空杯,有n杯水,n-1个人每个人选一杯水往一个瓶子里倒水,不溢出就YES。
题解:扔掉水最多的那一杯,剩下的和如果小于等于瓶子容积就YES。
#include <iostream>#include <algorithm>#include <string.h>#include <stdlib.h>#include <math.h>#include <stdio.h>using namespace std;int a[200050];int main(){ int i,n,t,c,sum=0; scanf("%d%d",&n,&c); for(i=0;i<n;i++) { cin>>a[i]; sum+=a[i]; } sort(a,a+n); sum-=a[n-1]; if(sum<=c) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0;}
- CodeForces - 426A(排序)
- CodeForces 230A 贪心+排序
- codeforces 101A HOME 排序
- codeforces-230A-Dragons(贪心+排序)
- Codeforces Round #287 (Div. 2)A(排序)
- codeforces 512A (拓扑排序)
- codeforces 426/A
- Dragons(CodeForces 230A)(贪心和排序)
- Codeforces #277.5 (Div. 2) A. SwapSort(基础:选择排序)
- Codeforces 558E. A Simple Task (线段树+计数排序)
- Codeforces 264A Buggy Sorting(童年排序)
- CodeForces 810C Do you want a date? 【数学】【排序】
- CodeForces-a
- Codeforces 903A A
- 【CodeForces】426Div2 A The Useless Toy
- CodeForces #426 div2 A The Useless Tony
- Codeforces Round #426 (Div. 2)(A+B)
- 【拓扑排序】 Codeforces Round #290 (Div. 1) A Fox And Names
- 辗转相除法的证明
- Codeforces 424A (思维题)
- CodeForces - 424B (贪心算法)
- 算法的重要性
- Codeforces 424C(异或)
- CodeForces - 426A(排序)
- CodeForces - 426B(对称图形)
- CodeForces - 427A (警察和罪犯 思维题)
- javascript 图片 懒加载、预加载
- CodeForces - 427B (模拟题)
- MyBatis之传入参数
- HDU 2.1.7 (求定积分公式)
- HDU2.2.3 (汉诺塔VII)
- android socket