39 lines
797 B
C++
39 lines
797 B
C++
/*
|
|
date:107/10/20
|
|
author:Chen Yi Jing
|
|
|
|
算當下最新的中位數
|
|
*/
|
|
#include <iostream>
|
|
using namespace std;
|
|
int main() {
|
|
int input = 0, index = 0;
|
|
long long int num[10001];
|
|
int middle = 0, temp = 0;
|
|
|
|
|
|
while (cin >> input) {
|
|
num[index] = input;
|
|
index++;
|
|
|
|
//sort
|
|
for (int i = index - 2; i >= 0; i--) {
|
|
if (num[i + 1] < num[i]) {
|
|
//swap
|
|
temp = num[i + 1];
|
|
num[i + 1] = num[i];
|
|
num[i] = temp;
|
|
}
|
|
}
|
|
|
|
//print midde number
|
|
if(index % 2 == 0) { //even
|
|
middle = (num[index / 2 - 1] + num[index / 2]) / 2;
|
|
}
|
|
else { //odd
|
|
middle = num[index / 2];
|
|
}
|
|
|
|
cout << middle << endl;
|
|
}
|
|
} |