Sequence Median
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 15792 | Accepted: 4409 |
Description
Given a sequence of N nonnegative integers. Let‘s define the median of such sequence. If N is odd the median is the element with stands in the middle of the sequence after it is sorted. One may notice that in this case the median has position (N+1)/2 in sorted sequence if sequence elements are numbered starting with 1. If N is even then the median is the semi-sum of the two "middle" elements of sorted sequence. I.e. semi-sum of the elements in positions N/2 and (N/2)+1 of sorted sequence. But original sequence might be unsorted.
Your task is to write program to find the median of given sequence.
Input
The first line of input contains the only integer number N - the length of the sequence. Sequence itself follows in subsequent lines, one number in a line. The length of the sequence lies in the range from 1 to 250000. Each element of the sequence is a positive integer not greater than 2^32 - 1 inclusive.
Output
You should print the value of the median with exactly one digit after decimal point.
Sample Input
4 3 6 4 5
Sample Output
4.5
Hint
Huge input,scanf is recommended.
------------------------------------------------------------------------------------------------
这道题可以直接用快排进行计算，然后直接计算中位数。
需要注意的小地方如下：
1. 数组类型：采用long long的原因是为了计算sum，这个值超过了unsinged的范围
2. 浮点数输出：对于大数字（2^32 - 1），不能用浮点数表示，而应该将浮点数拆分为整数和小数进行拼装。
-----------------------------------------------------------------------------------------------
1 #include <cstdio>
2 #include <algorithm>
3
4 using namespace std;
5
6 int main()
7 {
8 long long a[250005];
9 int n;
10 scanf("%d", &n);
11 for(int i = 0; i < n; i++)
12 {
13 scanf("%lld", &a[i]);
14 }
15 sort(a, a + n);
16 if(n & 1)
17 {
18 printf("%lld.0\n", a[n / 2]);
19 }
20 else
21 {
22 long long sum = a[n / 2] + a[n / 2 - 1];
23 printf("%lld", sum / 2);
24 if(sum & 1)
25 {
26 printf(".5\n");
27 }
28 else
29 {
30 printf(".0\n");
31 }
32 }
33
34 return 0;
35 }