HDOJ 1157 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.

一道求中位数的简单题

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<iostream>

#include<algorithm>

using namespace std;
bool cmp(int a,int b){ return a>b;
}//从大到小排序；

int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } sort(arr,arr+n,cmp); printf("%d\n",arr[(n-1)/2]); } return 0;
}


  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
 

下面用快排做：

/**#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<iostream>

#include<algorithm>

using namespace std;
bool cmp(int a,int b){ return a>b;
}//从大到小排序；

int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } sort(arr,arr+n,cmp); printf("%d\n",arr[(n-1)/2]); } return 0;
}
**/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<iostream>

#include<algorithm>

using namespace std;
int cmp(const void *x,const void *y){ return (*(int *)x-*(int *)y);//从小到大 /** return (*(int *)y-*(int *)x);//从大到小**/
}

int main(){ int n; while(scanf("%d",&n)==1){ int i,j,arr[10005]; for(i=0;i<n;i++){ scanf("%d",&arr[i]); } qsort(arr,n,sizeof(int),cmp); /**  for(int i=0;i<n;i++){ printf("%d\n",arr[i]); }**/ printf("%d\n",arr[(n-1)/2]); } return 0;
}


  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
 

文章来源: chenhx.blog.csdn.net，作者：谙忆，版权归原作者所有，如需转载，请联系作者。

原文链接：chenhx.blog.csdn.net/article/details/49428615