hdu1157 Who's in the Middle

Problem Description
FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or less. 

Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.
 

Input
* Line 1: A single integer N 

* Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.
 

Output
* Line 1: A single integer that is the median milk output.
 

Sample Input
  
  
5 2 4 1 3 5
 

Sample Output
  
  
3
Hint
INPUT DETAILS: Five cows with milk outputs of 1..5 OUTPUT DETAILS: 1 and 2 are below 3; 4 and 5 are above 3.
 

Source



C语言AC代码
#include<stdio.h>
void sort(int *a,int left,int right)
{
    if(left>=right)
        return ;
    int i=left;
    int j=right;
    int key=a[left];
    while(i<j)
    {
        while(i<j&&key<=a[j])
            j--;
        a[i]=a[j];
        while(i<j&&key>=a[i])
            i++;
        a[j]=a[i];
    }
    a[i]=key;
    sort(a,left,i-1);
    sort(a,i+1,right);
}
int main()
{
    int a[10010];
    int i,n;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,0,i-1);
        printf("%d\n",a[i/2]);
    }
    return 0;
}
思路:把N个数存入数组,排序,输出中间值即可,注意快拍的函数。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值