Hduoj1157 【水题】
来源:互联网 发布:淘宝客服绩效管理流程 编辑:程序博客网 时间:2024/06/13 22:34
/*Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9575 Accepted Submission(s): 4604Problem DescriptionFJ 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 Input524135 Sample Output3Hint INPUT DETAILS: Five cows with milk outputs of 1..5 OUTPUT DETAILS: 1 and 2 are below 3; 4 and 5 are above 3. SourceUSACO 2004 November */#include<stdio.h>#include<stdlib.h> int a[10100];int cmp(const void*a, const void *b){return *(int *)a - *(int *)b;}int main(){int n, i, j, k;while(scanf("%d", &n ) != EOF){for(i = 0; i < n; i++) scanf("%d", &a[i]);qsort(a, n, sizeof(a[0]), cmp);printf("%d\n", a[n/2]);}return 0;}
0 0
- Hduoj1157 【水题】
- 水题
- 水题
- 水题
- 水题
- 【水题】
- 水题
- 水题:
- 水题
- 水题~
- 水题
- 水题
- 水题
- 水题
- 水题
- 水题
- 【水题】
- 水题
- C# XML操作 代码大全(读XML,写XML,更新,删除节点,与dataset结合等)
- java copy文件
- NGUI视频
- XML遍历节点内部list
- hdu 4911 求逆序对数+树状数组
- Hduoj1157 【水题】
- linux shell数据重定向(输入重定向与输出重定向)详细分析
- java 字符串比较问题
- 关于ACM折半查找
- 最紫自纂姿追住最鬃咨嘴捉综坠总妆椎锥
- AIX_HP UX_LINUX 上ORACLE ASM 添加磁盘
- 用python做自动化测试--Python实现远程性能监控(1)
- 必须记住的CSS选择器
- HDU 3496 Watch The Movie(二维01背包)