<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
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 &lt;= N &lt; 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.
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
<ul>
<li>
Line 1: A single integer N
</li>
<li>
Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.
</li>
</ul>
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
<ul>
<li>Line 1: A single integer that is the median milk output.</li>
</ul>
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
5 
2 
4 
1 
3 
5
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
3
</blockquote>
<h2 id="hint">Hint</h2>
<blockquote>
INPUT DETAILS:
Five cows with milk outputs of 1..5
OUTPUT DETAILS:
1 and 2 are below 3; 4 and 5 are above 3.
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
对一组数求其中位数(连有两个中位数的情况都不用考虑)
直接排序即可
<h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
HomePage:http://www.oyohyee.com
Email:oyohyee@oyohyee.com
Blog:http://www.cnblogs.com/ohyee/

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/

#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
using namespace std;

//DEBUG MODE
#define debug 0

//循环
#define REP(n) for(int o=0;o&lt;n;o++)

const int maxn = 10005;
int a[maxn];

bool Do() {
 int n;
 if(scanf(&#34;%d&#34;,&amp;n) == EOF)
 return false;
 
 REP(n)
 scanf(&#34;%d&#34;,&amp;a[o]);

 sort(a,a + n);

 printf(&#34;%d\n&#34;,a[n/2]);

 return true;
}

int main() {
 while(Do());
 return 0;
}
</pre>

POJ 2388.Who's in the Middle