CodeForces - 426A(排序)
Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
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[];
int main()
{
int i,n,t,c,sum=;
scanf("%d%d",&n,&c);
for(i=;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sort(a,a+n);
sum-=a[n-];
if(sum<=c)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl; return ;
}
最新文章
- Visual Studio 2010的MSDN帮助文档离线使用
- 一周学会go语言并应用 by王奇疏
- Unity State Machine
- js改变HTML元素的值
- Coursera台大机器学习基础课程学习笔记2 -- 机器学习的分类
- 如果你遇到,在IntelliJ IDEA里Ctrl+Alt+方向键用不了
- Windows下一个比较完美的线程池实现(使用线程池实现的Http上传下载实现)
- Working with BeforeProperties and AfterProperties on SPItemEventReceiver
- 距离顶部估计像素,显示div!
- Delphi总结使用TStrings的一些技巧
- 【高精度乘法】NOIP2003麦森数
- deeplearning.ai 卷积神经网络 Week 3 目标检测 听课笔记
- PAT (Advanced Level) Practise 1003 解题报告
- Linux skbuff注释笔记
- linux下实现压测-html报表生成-控制台参数优化【jmeter】
- 更改npm全局模块和cache默认安装位置
- Apache PDFbox开发指南之PDF文档读取
- appium+python自动化33-解锁九宫格(TouchAction)
- 解决javac无效的目标发行版1.8问题
- IDLE崩溃:IDLE&#39;s subprocess didn&#39;t make connection. Either IDLE can&#39;t start a...