HDU 1157 Who's in the Middle(排序取中间值)

网友投稿 686 2022-08-24

HDU 1157 Who's in the Middle(排序取中间值)

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#include#include#include#include#include#includeusing namespace std;int main(){ int n,a[100010]; while(cin>>n){ for(int i=0;i>a[i]; sort(a,a+n); cout<

版权声明:本文内容由网络用户投稿,版权归原作者所有,本站不拥有其著作权,亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容,请联系我们jiasou666@gmail.com 处理,核实后本网站将在24小时内删除侵权内容。

上一篇:HDU 1106 排序(atoi函数和strtok函数)
下一篇:巴什博奕(Bash Game)
相关文章

 发表评论

暂时没有评论,来抢沙发吧~