https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=13&problem=1048&mosmsg=Submission+received+with+ID+17578534 困難度 ★ *注意資料型態可能有溢位的問題,本題做法是插入排序,泡沫排序
#include<stdio.h>
int main(){
long long arr[10000],n=0,num,i=0;
while(scanf("%d",&num)!=EOF){
if(n==0)arr[n]=num;
else{
arr[n]=num;
for(i=n;i>0;i--){
if(arr[i-1]<arr[i]){
arr[i]=arr[i-1];arr[i-1]=num;
}
}
}
if(n%2==0)printf("%lli\n",arr[n/2]);
else printf("%lli\n",(arr[n/2]+arr[(n/2)+1])/2);
n++;
}
return 0;
}
/*
題目:Q10107:What is the Median?
作者:1010
時間:西元 2016 年 5 月 */