ZOJ3499-Median
来源:互联网 发布:掷骰子js 编辑:程序博客网 时间:2024/06/07 14:03
A median is described as the numeric value separating the higher half of a list, from the lower half. The median of a finite list of numbers can be found by arranging all the elements from lowest value to highest value and picking the middle one. If there is an even number of elements, the median is then defined to be the mean of the two middle values. Now, could you write a program to help to find the median?
Input
There are multiple test cases. The first line of input is an integer T ≈ 100 indicating the number of test cases.
The first line of each test is an integer 0 < n < 500 indicating the number of elements. The second line consists of n numbers, the elements of the list, whose absolute values are smaller than 1,000,000.
Output
For each test case, output the median, with 3 decimal digits.
Sample Input
310.041.0 1000.3 100.2 10.152.0 3.0 5.0 7.0 11.0
Sample Output
0.00055.1505.000
References
- http://en.wikipedia.org/wiki/Median
Author: WU, Zejun
Contest: The 8th Zhejiang Provincial Collegiate Programming Contest
题意:求数列中位数。若有偶数个,找最中间两数的平均数。
#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;int main(){ int t,n,i; double a[509]; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%lf",&a[i]); sort(a,a+n); if(n%2) printf("%.3lf\n",a[(n-1)/2]); else printf("%.3lf\n",(a[(n-1)/2]+a[(n+1)/2])/2); } return 0;}
- ZOJ3499-Median
- zoj3499--Median//qsort
- Median
- Median
- Median
- median
- Median
- Median
- Median
- median
- median
- Median
- Median Filter
- M Median
- Find Median
- ZOJ3612 Median
- Median Filter
- zju2011 Median
- 构建需求响应式亿级商品详情页
- Codeforces 557D Vitaly and Cycle 【染色判二分图 + 组合数学】
- Android Studio 2.0 新特性体验
- 使用kickstart脚本安装CentOS7
- iOS基础框架的搭建 / 及国际化操作 代码讲解
- ZOJ3499-Median
- Hive-0.5中UDF和UDAF简述
- 数学史上最重要的女性:埃米·诺特
- 清除火狐浏览器的缓存数据
- 如何成为安卓软件开发工程师?
- 关于java中getInstance()方法
- 3D游戏编程大师技巧第一章 vs2013编译书本源码问题解决方案
- Charles:移动端设备网络抓包
- Android AsyncTask异步处理消息机制