1753: [Usaco2005 qua]Who's in the Middle (快速排序)
2014-07-12 22:35
309 查看
#include<algorithm> #include<cstdio> int n,a[10001]; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); std::sort(a+1,a+n+1); printf("%d",a[(n+1)/2]); return 0; }
相关文章推荐
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- BZOJ1753: [Usaco2005 qua]Who's in the Middle
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- 1753: [Usaco2005 qua]Who's in the Middle
- bzoj 1753: [Usaco2005 qua]Who's in the Middle【排序】
- BZOJ1753 [Usaco2005 qua]Who's in the Middle
- POJ2388-Who's in the Middle
- 北大OJ:2388:Who's in the Middle
- POJ 2388 Who's in the Middle(堆排序)
- 北大ACM2388 - Who's in the Middle(顺序统计学)
- POJ 2388 Who's in the Middle
- HDOJ 1157 HDU 1157 Who's in the Middle ACM 1157 IN HDU
- 杭电acm step 1.3.8 Who's in the Middle
- POJ 2388 Who's in the Middle(排序)
- HDU1157:Who's in the Middle
- POJ--2388 Who's in the Middle (续)
- C - Who's in the Middle(结题报告)
- POJ--2388 Who's in the Middle
- [HDOJ 1157] Who's in the Middle (基础题)