joj2357

 

• Authors
• Contests
•  
• Problems
•  
• Status
•  
• Links

Register

Login

Logout

My Account

My Groups

Coming

0 New

All

Goto

Volumes

Submit

Ranklist

Month Ranklist

Run Status

Online

Statistics

Home

JOJ Home

BBS

Downloads

Help

[新版judge已支持special judge；增加了提交后的状态页面；增加对提交代码的语言检查] [新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题][more]

Welcome, �γɺ�
[JPoints: 925, Sender!: 0/1]

2357: Median Number

---

ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1536657Standard

Given a series of integers, calculate the median value. If there are two median values, output the average of the two median values.

Input

The input contains multi-cases. The first line of each case contains N (N<=100) which is the number of the integers, and followed by N integers. N equals zero means the end of the input.

Output

For each test case, you should print the value.

Sample Input

3286413490

Sample Output

63.5

Problem Source: 1st Jilin Province Contest, skywind

---

This problem is used for contest: 63  145  157 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

 

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int  a[10000];
    int n;
    while(scanf("%d",&n),n)
    {
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        sort(a,a+n);
        if(n&1)printf("%d\n",a[(n+1)/2-1]);
        else printf("%3.1f\n",(a[n/2-1]+a[n/2])/(float)2);
    }
    return 0;
}