ACM 威士忌部分答案

				/*
				1157 Who's in the Middle
				
				GUN C++
				*/
				#include 
				#include 
				#include 
				using namespace std;
				
				const int Max=10001;
				
				int main()
				{
				    int t,n,i;
				    int milk[Max];
				
				    while(scanf("%d",&n)==1)
				    {
				        for(i=0;i				            scanf("%d",&milk[i]);
				        sort(milk,milk+n);
				        printf("%d\n",milk[n/2]);
				    }
				    return 0;
				}