ural 1306. Sequence Median(优先队列)

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 31−1 inclusive.

Output

You should print the value of the median with exactly one digit after decimal point.

Sample

input	output
4 3 6 4 5	4.5

#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;

priority_queue<int> que;    //优先队列，优先级高的元素先出队列

int main()
{
    int n,x,i,mid;
    double m,a,b;
    scanf("%d",&n);
    mid=n/2;
    for(i=0;i<=mid;i++)    //先输入n/2+1个数
    {
        scanf("%d",&x);
        que.push(x);        //入队列
    }
    for(i=mid+1;i<n;i++)
    {
        scanf("%d",&x);
        que.push(x);        //每加入一个数就进行排序，删除最顶的元素，始终保持
        que.pop();           //原来队列中的元素个数
    }
    if(n%2)
        m=(double)que.top();
    else
    {
        a=(double)que.top();
        que.pop();
        b=(double)que.top();
        m=(a+b)/2;
    }
    printf("%.1lf\n",m);

    return 0;
}

#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;

priority_queue<int> que;

int main()
{
    int n,x,i,mid;
    double m,a,b;
    scanf("%d",&n);
    mid=n/2;
    for(i=0;i<n;i++)
    {
        scanf("%d",&x);
        que.push(x);
        if(que.size()>mid+1)
            que.pop();
    }
    
    if(n%2)
        m=(double)que.top();
    else
    {
        a=(double)que.top();
        que.pop();
        b=(double)que.top();
        m=(a+b)/2;
    }
    printf("%.1lf\n",m);

    return 0;
}