【hdu - 1157 Who's in the Middle】

Who's in the Middle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4628    Accepted Submission(s): 2347

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

USACO 2004 November

 

 

Recommend

mcqsmall

 

 

 1 // Project name : 1157 ( Who's in the Middle ) 
 2 // File name    : main.cpp
 3 // Author       : Izumu
 4 // Date & Time  : Sun Jul  8 20:42:15 2012
 5 
 6 
 7 #include <iostream>
 8 #include <stdio.h>
 9 using namespace std;
10 
11 int main()
12 {
13     int n;
14     while (cin >> n)
15     {
16         int* a = new int[n];
17         int top = n - 1;
18         for (int i = 0; i < n; i++)
19         {
20             scanf("%d", &a[i]);
21         }
22 
23         for (int t = 0; t < n / 2; t++)
24         {
25             int flag = 0;
26             for (int i = 1; i <= top; i++)
27             {
28                 if (a[i] > a[flag])
29                 {
30                     flag = i;
31                 }
32             }
33             a[flag] = a[top];
34             top--;
35         }
36 
37         int flag = 0;
38         for (int i = 0; i <= top; i++)
39         {
40             if (a[i] > a[flag])
41             {
42                 flag = i;
43             }
44         }
45 
46         cout << a[flag] << endl;
47 
48         delete[] a;
49     }
50     return 0;
51 }
52 
53 // end 
54 // ism 

 

转载于:https://www.cnblogs.com/ismdeep/archive/2012/07/08/2581852.html