正文

10232006-06-09 18:49:00

【评论】 【打印】 【字体: 】 本文链接:http://blog.pfan.cn/bakers/15626.html

分享到:

Who's in the Middle Time Limit:1000MS  Memory Limit:65536KTotal Submit:14 Accepted:9 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 #include"iostream" #include"vector" using namespace std; vector<long>a; long med() { long i,j,flag,value; long si=a.size(); flag=1; for(i=0;i<si/2+1&&flag==1;i++) { flag=0; for(j=0;j<si-i;j++) if(a[j]>a[j+1]) { flag=1; value=a[j]; a[j]=a[j+1]; a[j+1]=value; } } return a[si/2+1]; } int main() { long i,n,sum=0,value; cin>>n; for(i=0;i<n;i++) { cin>>value; a.push_back(value); } cout<<med(); return 1; }

阅读(4445) | 评论(0)


版权声明:编程爱好者网站为此博客服务提供商,如本文牵涉到版权问题,编程爱好者网站不承担相关责任,如有版权问题请直接与本文作者联系解决。谢谢!

评论

暂无评论
您需要登录后才能评论,请 登录 或者 注册