ZOJ3499-Median

Median

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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

3
1
0.0
4
1.0 1000.3 100.2 10.1
5
2.0 3.0 5.0 7.0 11.0

Sample Output

0.000
55.150
5.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;
}