codeforces 426/A
来源:互联网 发布:淘宝衣服女装夏装 编辑:程序博客网 时间:2024/06/05 23:02
http://codeforces.com/problemset/problem/426/A
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ int n,m,a; while(~scanf("%d%d",&m,&n)) { int maxx=-1e9; int sum=0; for(int i=0;i<m;i++) { scanf("%d",&a); if(a>maxx) { maxx=a; } sum+=a; } if(sum-maxx<=n) printf("YES\n"); else printf("NO\n"); } return 0;}
0 0
- codeforces 426/A
- CodeForces - 426A(排序)
- 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 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- codeforces 417A A. Elimination
- CodeForces 534A A. Exam
- codeforces#98 a
- codeforces#99 a
- codeforces 105 div2 A
- J2ME中如何使用drawString()
- Ubuntu14.04+eclipse下cocos2d-x3.0正式版环境的搭建
- ZOJ-1954
- hdu 1506 Largest Rectangle in a Histogram
- haproxy 配置 说明
- codeforces 426/A
- Java 5种字符串拼接方式性能比较。
- [Code Jam] Bribe the Prisoners
- android AsyncTask
- Codeforces Round #243 (Div. 2)——Sereja and Swaps
- C++ string_demo
- 揭秘SNS自主创业军团 军团高层月赚10万元不是问题
- MongoDB基本命令
- 阵列源码学习实践(一)阵列的开机自动检测