codeforces 845A Chess Tourney
来源:互联网 发布:广州优享网络 编辑:程序博客网 时间:2024/05/16 12:00
点击打开链接
要是一队必须全胜,那就排序后直接判断第n个和n+1的值,是我想多了
#include<cstdio>#include<algorithm>using namespace std;int main(){ int n; scanf("%d",&n); int a[210]; for(int i=1;i<=2*n;i++) scanf("%d",&a[i]); sort(a+1,a+2*n+1); if(a[n]<a[n+1]) printf("YES\n"); else printf("NO\n"); return 0;}
阅读全文
0 0
- codeforces 845A Chess Tourney
- Codeforces 845 A Chess Tourney
- codeforces 845A Chess Tourney
- Codeforces 845A Chess Tourney
- Codeforces 845 A. Chess Tourney 思路:简单逻辑题
- A. Chess Tourney【Educational Codeforces Round 27】
- cfA.Chess Tourney
- codeforces 7A - Kalevitch and Chess
- Codeforces 7A Kalevitch and Chess
- CodeForces 7A Kalevitch and Chess
- CodeForces 7A Kalevitch and Chess
- CodeForces 7A Kalevitch and Chess
- codeforces 7 A. Kalevitch and Chess
- CodeForces 7A - Kalevitch and Chess
- CodeForces 7A Kalevitch and Chess
- Codeforces 7A Kalevitch and Chess
- Codeforces 664A Gerald and Giant Chess
- CodeForces 893A Chess For Three
- 正睿OI 2017冲刺T1Wa掉有点忧伤........
- 博弈——Doubloon Game
- 2072删数问题
- RQNOJ 188 购物问题
- python3 云词(wordcloud)安装失败解决方案
- codeforces 845A Chess Tourney
- Android native和h5混合开发几种常见的hybrid通信方式
- Redhat 7将网卡名称eno16777736改为eth0
- 献给30岁之前为前途迷茫彷徨的男人们的忠告
- 非常好的理解遗传算法的例子
- SQL 分为三种类型
- 大端和小端
- c语言学习之内存重叠
- 图论--tarjan求割点