HDU 1157 Who's in the Middle(排序取中间值)
2016-04-21 19:07
411 查看
Who’s in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14554 Accepted Submission(s): 6530
Problem Description
FJ is surveying his herd to find the most average cow. He wants to know how much milk this ‘median’ cow gives: half of the cows give as much or more than the median; half give as much or less.
Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.
Input
* Line 1: A single integer N
Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.
Output
* Line 1: A single integer that is the median milk output.
Sample Input
5
2
4
1
3
5
Sample Output
3
Hint
INPUT DETAILS:
Five cows with milk outputs of 1..5
OUTPUT DETAILS:
1 and 2 are below 3; 4 and 5 are above 3.
Source
USACO 2004 November
AC代码:
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<string> #include<cstdlib> #include<algorithm> using namespace std; int main() { int n,a[100010]; while(cin>>n){ for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); cout<<a[n/2]<<endl; } return 0; }
相关文章推荐
- 使用assembly将maven项目pom.xml中的jar包打包
- z-index问题
- 十天冲刺开发第四天个人工作总结
- 严重: StandardServer.await: create[localhost:8005]
- 正式赛-ZZULIOJ-1881-蛤玮的机房(并查集)
- hadoop 学习笔记:mapreduce框架详解
- IOS中,Button的currentTitle和titleLabel.text的使用
- C#项目调用C++的DLL程序
- STM32F103RCT6 LED灯程序设计
- 说一下积性函数咯(更新中).
- Oracle 系统表
- C/C++宏定义的可变参数
- HDU 1754 线段树(单点更新)
- 数据结构-树状数组讲解
- KMP 算法模板
- POJ 2752 Seek the Name, Seek the Fame
- POJ 3461 Oulipo
- HDU 2586 How far away ?(lca)
- LCA模板
- Redis主从备份以及key的过期时间配置