ACM 10107 What is the Median?

 照著直覺做，排序用Insertion Sort

#include <stdio.h>

int num[10000];

int main(void)
{
    int i, j, temp;
   
    i = 0;
    while (scanf("%d", &num[i]) == 1)
    {
        j = i-1;
        temp = num[i];
        while (j >= 0 && num[j] > temp)
        {
            num[j+1] = num[j];
            j--;
        }
        num[j+1] = temp;
        if ((i+1)%2)
            printf("%d\n", num[(i+1)/2]);
        else
            printf("%d\n", (num[i/2]+num[i/2+1])/2);
        i++;
    }
   
    return 0;
}