设为首页 加入收藏

TOP

HDU1157 Who's in the Middle
2015-07-20 17:48:44 来源: 作者: 【 】 浏览:12
Tags:HDU1157 Who' the Middle

Who's in the Middle

Time Limit: 2000/1000 MS ( Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9411 Accepted Submission(s): 4538

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

水水水

#include 
  
   
#include 
   
     using std::sort; #define maxn 10002 int arr[maxn]; int main() { int n, i; while(scanf("%d", &n) == 1){ for(i = 0; i < n; ++i) scanf("%d", &arr[i]); sort(arr, arr + n); printf("%d\n", arr[(n-1) >> 1]); } return 0; }
   
  


】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇uva 1493 - Draw a Mess(并查集) 下一篇HDU 1203 I NEED A OFFER!(01背包)

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容:

·C语言中如何将结构体 (2025-12-24 22:20:09)
·纯C语言结构体成员变 (2025-12-24 22:20:06)
·C语言中,指针函数和 (2025-12-24 22:20:03)
·哈希表 - 菜鸟教程 (2025-12-24 20:18:55)
·MySQL存储引擎InnoDB (2025-12-24 20:18:53)